YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:24:25,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:24:25,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:24:25,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:24:25,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:24:25,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:24:25,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:24:25,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:24:25,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:24:25,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:24:25,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:24:25,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:24:25,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:24:25,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:24:25,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:24:25,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:24:25,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:24:25,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:24:25,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:24:25,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:24:25,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:24:25,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:24:25,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:24:25,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:24:25,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:24:25,422 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:24:25,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:24:25,423 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:24:25,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:24:25,424 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:24:25,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:24:25,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:24:25,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:24:25,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:24:25,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:24:25,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:24:25,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:24:25,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:24:25,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:24:25,429 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:24:25,443 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:24:25,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:24:25,444 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:24:25,444 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:24:25,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:24:25,444 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:24:25,445 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:24:25,445 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:24:25,446 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:24:25,446 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:24:25,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:24:25,446 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:24:25,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:24:25,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:24:25,447 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:24:25,447 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:24:25,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:24:25,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:24:25,447 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:24:25,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:25,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:24:25,448 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:24:25,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:24:25,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:24:25,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:24:25,487 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:24:25,491 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:24:25,492 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:24:25,493 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:24:25,493 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:24:25,560 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/9c441cccae4242a38ebe7419261c5f77/FLAG8510a151f [2020-06-22 10:24:25,897 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:24:25,898 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:24:25,898 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:24:25,905 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/9c441cccae4242a38ebe7419261c5f77/FLAG8510a151f [2020-06-22 10:24:26,309 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/9c441cccae4242a38ebe7419261c5f77 [2020-06-22 10:24:26,320 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:24:26,322 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:24:26,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:24:26,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:24:26,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d8a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26, skipping insertion in model container [2020-06-22 10:24:26,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:24:26,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:24:26,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,581 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:24:26,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,614 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:24:26,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26 WrapperNode [2020-06-22 10:24:26,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:24:26,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:24:26,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:24:26,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:24:26,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:24:26,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:24:26,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:24:26,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:24:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:24:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:24:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:24:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:24:26,921 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:24:26,921 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:24:26,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26 BoogieIcfgContainer [2020-06-22 10:24:26,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:24:26,923 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:24:26,924 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:24:26,926 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:24:26,926 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,942 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 17 edges [2020-06-22 10:24:26,943 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:24:26,944 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:24:26,945 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:24:26,945 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:26,947 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:24:26,948 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:24:26,948 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:24:26,964 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:24:26,981 INFO L200 BlockEncoder]: SBE split 3 edges [2020-06-22 10:24:26,986 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:24:26,987 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,022 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:24:27,024 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:24:27,026 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:24:27,026 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,026 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:24:27,027 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:24:27,027 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges [2020-06-22 10:24:27,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27 BasicIcfg [2020-06-22 10:24:27,028 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:24:27,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:24:27,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:24:27,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:24:27,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:24:26" (1/4) ... [2020-06-22 10:24:27,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397ab5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/4) ... [2020-06-22 10:24:27,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397ab5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (3/4) ... [2020-06-22 10:24:27,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397ab5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/4) ... [2020-06-22 10:24:27,036 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:27,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:24:27,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-06-22 10:24:27,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-06-22 10:24:27,101 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:27,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:24:27,102 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:24:27,103 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:27,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:27,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:27,103 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:24:27,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:27,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:24:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-06-22 10:24:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:27,123 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:27,124 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash 86507541, now seen corresponding path program 1 times [2020-06-22 10:24:27,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:27,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:27,335 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2020-06-22 10:24:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,394 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-06-22 10:24:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:24:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,407 INFO L225 Difference]: With dead ends: 8 [2020-06-22 10:24:27,407 INFO L226 Difference]: Without dead ends: 7 [2020-06-22 10:24:27,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:24:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-06-22 10:24:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-06-22 10:24:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:24:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-06-22 10:24:27,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 5 [2020-06-22 10:24:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,445 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-06-22 10:24:27,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2020-06-22 10:24:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:27,446 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:27,446 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash 86507543, now seen corresponding path program 1 times [2020-06-22 10:24:27,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:27,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:27,511 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2020-06-22 10:24:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,552 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-06-22 10:24:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:27,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:24:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,554 INFO L225 Difference]: With dead ends: 8 [2020-06-22 10:24:27,554 INFO L226 Difference]: Without dead ends: 7 [2020-06-22 10:24:27,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:24:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-06-22 10:24:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-06-22 10:24:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:24:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-06-22 10:24:27,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 5 [2020-06-22 10:24:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,558 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-06-22 10:24:27,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2020-06-22 10:24:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:27,558 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:27,559 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 86507544, now seen corresponding path program 1 times [2020-06-22 10:24:27,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:27,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:27,600 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. [2020-06-22 10:24:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,641 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2020-06-22 10:24:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:24:27,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:24:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,642 INFO L225 Difference]: With dead ends: 10 [2020-06-22 10:24:27,642 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 10:24:27,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:24:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 10:24:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 10:24:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:24:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-06-22 10:24:27,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2020-06-22 10:24:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,646 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-06-22 10:24:27,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-06-22 10:24:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:24:27,647 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,647 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-06-22 10:24:27,647 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1529377172, now seen corresponding path program 1 times [2020-06-22 10:24:27,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:27,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:27,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:24:27,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:27,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-06-22 10:24:27,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:24:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:24:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:24:27,844 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2020-06-22 10:24:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,934 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-06-22 10:24:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:24:27,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2020-06-22 10:24:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,935 INFO L225 Difference]: With dead ends: 9 [2020-06-22 10:24:27,935 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:24:27,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:24:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:24:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:24:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:24:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:24:27,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-06-22 10:24:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:27,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:24:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:24:27,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:24:27,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:24:28,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:24:28,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:24:28,058 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:24:28,058 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:24:28,058 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:24:28,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:24:28,059 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse0 (<= (* 4 ULTIMATE.start_sumOfThirdBytes_~array_size) (select |#length| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse1 (= 1 (select |#valid| |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|))) (.cse2 (= 0 |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|))) (or (and (<= ULTIMATE.start_sumOfThirdBytes_~p~0.offset (+ |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset| (* 4 ULTIMATE.start_sumOfThirdBytes_~i~0) 2)) .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_sumOfThirdBytes_~i~0)) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0)))) [2020-06-22 10:24:28,059 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:24:28,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:28,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:28,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:28,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:28,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:28 BasicIcfg [2020-06-22 10:24:28,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:24:28,079 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:24:28,079 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:24:28,082 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:24:28,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:28,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:24:26" (1/5) ... [2020-06-22 10:24:28,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50786831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:28, skipping insertion in model container [2020-06-22 10:24:28,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:28,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/5) ... [2020-06-22 10:24:28,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50786831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:28, skipping insertion in model container [2020-06-22 10:24:28,084 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:28,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (3/5) ... [2020-06-22 10:24:28,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50786831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:28, skipping insertion in model container [2020-06-22 10:24:28,084 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:28,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/5) ... [2020-06-22 10:24:28,085 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50786831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:28, skipping insertion in model container [2020-06-22 10:24:28,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:28,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:28" (5/5) ... [2020-06-22 10:24:28,087 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:28,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:28,107 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:24:28,107 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:24:28,107 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:28,107 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:28,107 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:28,107 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:24:28,107 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:28,107 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:24:28,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 10:24:28,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:28,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:28,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:28,119 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:24:28,119 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:24:28,119 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:24:28,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 10:24:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:28,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:28,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:28,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:24:28,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:24:28,126 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 9#L20true [40] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 6#L20-2true [56] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 5#L10-3true [2020-06-22 10:24:28,126 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-3true [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 7#L13true [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 5#L10-3true [2020-06-22 10:24:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 89708, now seen corresponding path program 1 times [2020-06-22 10:24:28,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 1 times [2020-06-22 10:24:28,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 86210600, now seen corresponding path program 1 times [2020-06-22 10:24:28,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:28,394 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:28,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:28,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:28,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:28,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:28,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:28,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:28,397 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:28,397 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:24:28,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:28,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:28,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:28,819 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:28,824 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:28,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:28,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:28,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:28,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:28,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:28,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:28,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:28,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:28,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:28,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:28,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:28,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:28,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:28,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:28,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:28,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:28,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:28,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:28,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:28,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:28,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:28,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:28,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:28,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:28,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:28,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:28,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:28,943 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 10:24:28,943 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 10:24:28,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:28,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:24:28,948 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:28,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-06-22 10:24:28,953 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 10:24:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:24:28,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:24:28,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,026 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:24:29,029 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:24:29,030 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 3 states. [2020-06-22 10:24:29,066 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 3 states. Result 15 states and 24 transitions. Complement of second has 4 states. [2020-06-22 10:24:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:24:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:24:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-06-22 10:24:29,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:24:29,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 10:24:29,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 10:24:29,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 24 transitions. [2020-06-22 10:24:29,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:29,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 5 states and 6 transitions. [2020-06-22 10:24:29,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 10:24:29,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 10:24:29,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-06-22 10:24:29,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:29,082 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 10:24:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-06-22 10:24:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-22 10:24:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:24:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 10:24:29,083 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 10:24:29,084 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 10:24:29,084 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:24:29,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-06-22 10:24:29,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:29,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,085 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:24:29,085 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:24:29,085 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 66#L20 [40] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 69#L20-2 [55] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 67#L10-3 [2020-06-22 10:24:29,085 INFO L796 eck$LassoCheckResult]: Loop: 67#L10-3 [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 68#L13 [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 67#L10-3 [2020-06-22 10:24:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash 89707, now seen corresponding path program 1 times [2020-06-22 10:24:29,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 2 times [2020-06-22 10:24:29,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 86209639, now seen corresponding path program 1 times [2020-06-22 10:24:29,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,281 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:29,281 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:29,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:29,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:29,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:29,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:29,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:29,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:29,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:24:29,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:29,282 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:29,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:29,551 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:29,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:29,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:29,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:29,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:29,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:29,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:29,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:29,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:29,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:29,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:29,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:29,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:29,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:29,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:29,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:29,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:29,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:29,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:29,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:29,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:29,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:29,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:29,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:29,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:29,589 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:29,606 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:24:29,606 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:24:29,606 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:29,608 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 10:24:29,608 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:29,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~i~0) = -2*ULTIMATE.start_sumOfThirdBytes_~i~0 + 1 Supporting invariants [-1*ULTIMATE.start_sumOfThirdBytes_~array_size + 1 >= 0] [2020-06-22 10:24:29,616 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-06-22 10:24:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:24:29,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:24:29,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,728 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:24:29,729 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-06-22 10:24:29,729 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-06-22 10:24:29,783 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 10 states. [2020-06-22 10:24:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 10:24:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:24:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-06-22 10:24:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:24:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 10:24:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 10:24:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:29,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-06-22 10:24:29,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:29,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 7 states and 7 transitions. [2020-06-22 10:24:29,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:24:29,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 10:24:29,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2020-06-22 10:24:29,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:29,790 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-06-22 10:24:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2020-06-22 10:24:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2020-06-22 10:24:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:24:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2020-06-22 10:24:29,792 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-22 10:24:29,792 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-22 10:24:29,792 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:24:29,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. [2020-06-22 10:24:29,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:24:29,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,793 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:24:29,793 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:24:29,794 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY [61] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_9|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 150#L20 [50] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 153#L20-2 [55] L20-2-->L10-3: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1 0) (= v_ULTIMATE.start_sumOfThirdBytes_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= v_ULTIMATE.start_sumOfThirdBytes_~array_size_1 |v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1| |v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_1, ULTIMATE.start_sumOfThirdBytes_#in~array_size=|v_ULTIMATE.start_sumOfThirdBytes_#in~array_size_1|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_1, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_1, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.base_1|, ULTIMATE.start_sumOfThirdBytes_#res=|v_ULTIMATE.start_sumOfThirdBytes_#res_1|, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset_1|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_1} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~#numbers.offset, ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_#in~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_sumOfThirdBytes_~#numbers.base, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#in~numbers.base, ULTIMATE.start_sumOfThirdBytes_#res, ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset, ULTIMATE.start_sumOfThirdBytes_~sum~0] 151#L10-3 [2020-06-22 10:24:29,794 INFO L796 eck$LassoCheckResult]: Loop: 151#L10-3 [37] L10-3-->L13: Formula: (and (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3 |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|) (< v_ULTIMATE.start_sumOfThirdBytes_~i~0_5 v_ULTIMATE.start_sumOfThirdBytes_~array_size_4) (= v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3 (+ |v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3| (* 4 v_ULTIMATE.start_sumOfThirdBytes_~i~0_5) 2))) InVars {ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_3, ULTIMATE.start_sumOfThirdBytes_~#numbers.base=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.base_3|, ULTIMATE.start_sumOfThirdBytes_~#numbers.offset=|v_ULTIMATE.start_sumOfThirdBytes_~#numbers.offset_3|, ULTIMATE.start_sumOfThirdBytes_~array_size=v_ULTIMATE.start_sumOfThirdBytes_~array_size_4, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_5, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~p~0.offset, ULTIMATE.start_sumOfThirdBytes_~p~0.base] 152#L13 [65] L13-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8) (<= (+ v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8 1) (select |v_#length_6| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9)) (= (select |v_#valid_14| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) 1) (= v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11 (+ v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12 (select (select |v_#memory_int_3| v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9) v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8))) (= (+ v_ULTIMATE.start_sumOfThirdBytes_~i~0_11 1) v_ULTIMATE.start_sumOfThirdBytes_~i~0_10)) InVars {ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_11, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_12} OutVars{ULTIMATE.start_sumOfThirdBytes_~p~0.offset=v_ULTIMATE.start_sumOfThirdBytes_~p~0.offset_8, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_sumOfThirdBytes_~i~0=v_ULTIMATE.start_sumOfThirdBytes_~i~0_10, #length=|v_#length_6|, ULTIMATE.start_sumOfThirdBytes_#t~post0=|v_ULTIMATE.start_sumOfThirdBytes_#t~post0_4|, ULTIMATE.start_sumOfThirdBytes_~p~0.base=v_ULTIMATE.start_sumOfThirdBytes_~p~0.base_9, ULTIMATE.start_sumOfThirdBytes_#t~mem1=|v_ULTIMATE.start_sumOfThirdBytes_#t~mem1_7|, ULTIMATE.start_sumOfThirdBytes_~sum~0=v_ULTIMATE.start_sumOfThirdBytes_~sum~0_11} AuxVars[] AssignedVars[ULTIMATE.start_sumOfThirdBytes_~i~0, ULTIMATE.start_sumOfThirdBytes_#t~post0, ULTIMATE.start_sumOfThirdBytes_#t~mem1, ULTIMATE.start_sumOfThirdBytes_~sum~0] 151#L10-3 [2020-06-22 10:24:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash 90017, now seen corresponding path program 1 times [2020-06-22 10:24:29,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2173, now seen corresponding path program 3 times [2020-06-22 10:24:29,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 86507549, now seen corresponding path program 1 times [2020-06-22 10:24:29,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,959 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:29,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:29,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:29,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:29,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:29,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:29,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:29,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:29,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:24:29,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:29,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:29,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:30,259 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:30,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:30,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:30,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:30,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:30,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:30,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:30,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:30,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:30,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:30,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:30,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:30,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:30,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:30,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:30,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:30,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:30,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:30,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:30,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:30,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:30,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:30,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:30,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:30,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:30,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:30,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:30,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:30,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:30,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:30,308 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:30,320 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:24:30,320 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:24:30,321 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:30,322 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:24:30,322 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:30,322 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-06-22 10:24:30,326 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 10:24:30,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:24:30,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:24:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:30,381 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:24:30,381 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:24:30,381 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 3 states. [2020-06-22 10:24:30,392 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 4 states. [2020-06-22 10:24:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:24:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:24:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-06-22 10:24:30,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:24:30,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:30,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 10:24:30,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:30,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 10:24:30,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:30,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-06-22 10:24:30,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:24:30,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 0 states and 0 transitions. [2020-06-22 10:24:30,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:24:30,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:24:30,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:24:30,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:30,397 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:30,397 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:30,397 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:30,397 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:24:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:24:30,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:24:30,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:24:30,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:30 BasicIcfg [2020-06-22 10:24:30,403 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:24:30,404 INFO L168 Benchmark]: Toolchain (without parser) took 4083.09 ms. Allocated memory was 649.6 MB in the beginning and 745.5 MB in the end (delta: 95.9 MB). Free memory was 564.3 MB in the beginning and 430.4 MB in the end (delta: 133.9 MB). Peak memory consumption was 229.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,406 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:24:30,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.78 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 564.3 MB in the beginning and 628.2 MB in the end (delta: -64.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.73 ms. Allocated memory is still 664.8 MB. Free memory was 628.2 MB in the beginning and 626.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,407 INFO L168 Benchmark]: Boogie Preprocessor took 22.58 ms. Allocated memory is still 664.8 MB. Free memory was 626.9 MB in the beginning and 624.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,408 INFO L168 Benchmark]: RCFGBuilder took 246.07 ms. Allocated memory is still 664.8 MB. Free memory was 624.2 MB in the beginning and 608.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,409 INFO L168 Benchmark]: BlockEncodingV2 took 104.42 ms. Allocated memory is still 664.8 MB. Free memory was 608.4 MB in the beginning and 600.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,409 INFO L168 Benchmark]: TraceAbstraction took 1049.39 ms. Allocated memory is still 664.8 MB. Free memory was 600.3 MB in the beginning and 511.6 MB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,410 INFO L168 Benchmark]: BuchiAutomizer took 2324.99 ms. Allocated memory was 664.8 MB in the beginning and 745.5 MB in the end (delta: 80.7 MB). Free memory was 510.2 MB in the beginning and 430.4 MB in the end (delta: 79.8 MB). Peak memory consumption was 160.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:30,414 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 17 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.78 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 564.3 MB in the beginning and 628.2 MB in the end (delta: -64.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.73 ms. Allocated memory is still 664.8 MB. Free memory was 628.2 MB in the beginning and 626.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.58 ms. Allocated memory is still 664.8 MB. Free memory was 626.9 MB in the beginning and 624.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 246.07 ms. Allocated memory is still 664.8 MB. Free memory was 624.2 MB in the beginning and 608.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 104.42 ms. Allocated memory is still 664.8 MB. Free memory was 608.4 MB in the beginning and 600.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1049.39 ms. Allocated memory is still 664.8 MB. Free memory was 600.3 MB in the beginning and 511.6 MB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2324.99 ms. Allocated memory was 664.8 MB in the beginning and 745.5 MB in the end (delta: 80.7 MB). Free memory was 510.2 MB in the beginning and 430.4 MB in the end (delta: 79.8 MB). Peak memory consumption was 160.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 10:24:30,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:30,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:30,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:30,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((p <= numbers + 4 * i + 2 && 4 * array_size <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers]) && 0 == numbers) && 1 <= i) || (((4 * array_size <= unknown-#length-unknown[numbers] && 1 == \valid[numbers]) && 0 == numbers) && 0 == i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 13 SDslu, 29 SDs, 0 SdLazy, 62 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 47 HoareAnnotationTreeSize, 1 FomulaSimplifications, 283 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 1 QuantifiedInterpolants, 512 SizeOfPredicates, 5 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 7 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 37 SDslu, 6 SDs, 0 SdLazy, 47 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital118 mio100 ax100 hnf100 lsp94 ukn80 mio100 lsp61 div100 bol100 ite100 ukn100 eq193 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:24:23.094 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:24:30.649 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check