YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:35:38,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:35:38,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:35:38,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:35:38,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:35:38,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:35:38,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:35:38,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:35:38,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:35:38,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:35:38,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:35:38,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:35:38,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:35:38,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:35:38,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:35:38,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:35:38,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:35:38,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:35:38,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:35:38,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:35:38,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:35:38,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:35:38,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:35:38,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:35:38,676 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:35:38,677 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:35:38,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:35:38,678 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:35:38,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:35:38,679 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:35:38,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:35:38,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:35:38,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:35:38,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:35:38,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:35:38,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:35:38,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:35:38,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:35:38,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:35:38,685 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:35:38,699 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:35:38,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:35:38,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:35:38,700 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:35:38,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:35:38,701 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:35:38,701 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:35:38,701 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:35:38,701 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:35:38,701 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:35:38,702 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:35:38,702 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:35:38,702 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:35:38,702 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:35:38,702 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:35:38,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:35:38,703 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:35:38,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:35:38,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:35:38,703 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:35:38,703 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:35:38,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:35:38,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:35:38,704 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:35:38,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:35:38,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:35:38,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:35:38,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:35:38,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:35:38,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:35:38,744 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:35:38,748 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:35:38,749 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:35:38,749 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:35:38,750 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:35:38,814 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/3a915ba8e131424a9269c04bd919bd3b/FLAGd0b5478b1 !SESSION 2020-06-22 10:35:36.250 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 10:35:39.071 !MESSAGE Indexed 'FLAGd0b5478b1' (0 sources, 0 headers) in 0.01 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 10:35:39,157 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:35:39,157 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:35:39,158 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:35:39,164 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/3a915ba8e131424a9269c04bd919bd3b/FLAGd0b5478b1 [2020-06-22 10:35:39,593 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/3a915ba8e131424a9269c04bd919bd3b [2020-06-22 10:35:39,604 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:35:39,606 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:35:39,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:35:39,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:35:39,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:35:39,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d685d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39, skipping insertion in model container [2020-06-22 10:35:39,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:35:39,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:35:39,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:35:39,867 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:35:39,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:35:39,903 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:35:39,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39 WrapperNode [2020-06-22 10:35:39,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:35:39,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:35:39,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:35:39,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:35:39,914 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:35:39" (1/1) ... [2020-06-22 10:35:39,924 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:35:39" (1/1) ... [2020-06-22 10:35:39,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:35:39,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:35:39,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:35:39,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:35:39,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... [2020-06-22 10:35:39,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:35:39,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:35:39,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:35:39,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:35:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:35:40,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:35:40,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:35:40,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:35:40,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:35:40,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:35:40,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:35:40,467 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:35:40,468 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:35:40,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:40 BoogieIcfgContainer [2020-06-22 10:35:40,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:35:40,470 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:35:40,470 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:35:40,473 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:35:40,473 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:40" (1/1) ... [2020-06-22 10:35:40,491 INFO L313 BlockEncoder]: Initial Icfg 62 locations, 67 edges [2020-06-22 10:35:40,492 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:35:40,493 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:35:40,494 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:35:40,494 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:35:40,496 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:35:40,497 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:35:40,497 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:35:40,527 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:35:40,580 INFO L200 BlockEncoder]: SBE split 35 edges [2020-06-22 10:35:40,586 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:35:40,588 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:35:40,630 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:35:40,633 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:35:40,635 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:35:40,635 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:35:40,636 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:35:40,636 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:35:40,637 INFO L313 BlockEncoder]: Encoded RCFG 53 locations, 135 edges [2020-06-22 10:35:40,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:35:40 BasicIcfg [2020-06-22 10:35:40,637 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:35:40,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:35:40,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:35:40,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:35:40,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:35:39" (1/4) ... [2020-06-22 10:35:40,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186411a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:35:40, skipping insertion in model container [2020-06-22 10:35:40,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (2/4) ... [2020-06-22 10:35:40,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186411a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:35:40, skipping insertion in model container [2020-06-22 10:35:40,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:40" (3/4) ... [2020-06-22 10:35:40,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186411a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:35:40, skipping insertion in model container [2020-06-22 10:35:40,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:35:40" (4/4) ... [2020-06-22 10:35:40,646 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:35:40,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:35:40,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-06-22 10:35:40,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-06-22 10:35:40,710 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:35:40,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:35:40,711 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:35:40,711 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:35:40,711 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:35:40,711 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:35:40,711 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:35:40,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:35:40,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:35:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-06-22 10:35:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:35:40,732 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:40,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:35:40,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash 147523, now seen corresponding path program 1 times [2020-06-22 10:35:40,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:40,925 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:35:40,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:40,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:40,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:40,949 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-06-22 10:35:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:41,263 INFO L93 Difference]: Finished difference Result 91 states and 233 transitions. [2020-06-22 10:35:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:41,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:35:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:41,280 INFO L225 Difference]: With dead ends: 91 [2020-06-22 10:35:41,280 INFO L226 Difference]: Without dead ends: 51 [2020-06-22 10:35:41,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-06-22 10:35:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-06-22 10:35:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-06-22 10:35:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 101 transitions. [2020-06-22 10:35:41,325 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 101 transitions. Word has length 3 [2020-06-22 10:35:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:41,326 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 101 transitions. [2020-06-22 10:35:41,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 101 transitions. [2020-06-22 10:35:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:35:41,327 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:41,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:35:41,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash 147525, now seen corresponding path program 1 times [2020-06-22 10:35:41,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:41,375 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:35:41,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:41,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:41,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,378 INFO L87 Difference]: Start difference. First operand 51 states and 101 transitions. Second operand 3 states. [2020-06-22 10:35:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:41,577 INFO L93 Difference]: Finished difference Result 51 states and 101 transitions. [2020-06-22 10:35:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:41,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:35:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:41,598 INFO L225 Difference]: With dead ends: 51 [2020-06-22 10:35:41,598 INFO L226 Difference]: Without dead ends: 49 [2020-06-22 10:35:41,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-06-22 10:35:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-06-22 10:35:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 10:35:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2020-06-22 10:35:41,606 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 97 transitions. Word has length 3 [2020-06-22 10:35:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:41,607 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 97 transitions. [2020-06-22 10:35:41,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 97 transitions. [2020-06-22 10:35:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:35:41,607 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:41,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:35:41,608 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 4570514, now seen corresponding path program 1 times [2020-06-22 10:35:41,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:41,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:41,652 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:35:41,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:41,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:41,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:41,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:41,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,654 INFO L87 Difference]: Start difference. First operand 49 states and 97 transitions. Second operand 3 states. [2020-06-22 10:35:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:41,842 INFO L93 Difference]: Finished difference Result 49 states and 97 transitions. [2020-06-22 10:35:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:41,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:35:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:41,844 INFO L225 Difference]: With dead ends: 49 [2020-06-22 10:35:41,845 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 10:35:41,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 10:35:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-06-22 10:35:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 10:35:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 95 transitions. [2020-06-22 10:35:41,852 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 95 transitions. Word has length 4 [2020-06-22 10:35:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:41,852 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 95 transitions. [2020-06-22 10:35:41,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 95 transitions. [2020-06-22 10:35:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:35:41,853 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:41,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:35:41,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 4570516, now seen corresponding path program 1 times [2020-06-22 10:35:41,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:41,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:41,912 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:35:41,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:41,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:41,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:41,913 INFO L87 Difference]: Start difference. First operand 48 states and 95 transitions. Second operand 3 states. [2020-06-22 10:35:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:42,072 INFO L93 Difference]: Finished difference Result 48 states and 95 transitions. [2020-06-22 10:35:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:42,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:35:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:42,074 INFO L225 Difference]: With dead ends: 48 [2020-06-22 10:35:42,074 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 10:35:42,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 10:35:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 10:35:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:35:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 93 transitions. [2020-06-22 10:35:42,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 93 transitions. Word has length 4 [2020-06-22 10:35:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:42,081 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 93 transitions. [2020-06-22 10:35:42,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 93 transitions. [2020-06-22 10:35:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:35:42,081 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:42,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:35:42,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash 141682929, now seen corresponding path program 1 times [2020-06-22 10:35:42,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:42,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:42,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:42,119 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:35:42,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:42,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:42,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,121 INFO L87 Difference]: Start difference. First operand 47 states and 93 transitions. Second operand 3 states. [2020-06-22 10:35:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:42,255 INFO L93 Difference]: Finished difference Result 47 states and 93 transitions. [2020-06-22 10:35:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:42,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:35:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:42,257 INFO L225 Difference]: With dead ends: 47 [2020-06-22 10:35:42,257 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:35:42,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:35:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:35:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:35:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 79 transitions. [2020-06-22 10:35:42,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 79 transitions. Word has length 5 [2020-06-22 10:35:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:42,263 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 79 transitions. [2020-06-22 10:35:42,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 79 transitions. [2020-06-22 10:35:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:35:42,264 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:42,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:35:42,264 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 141682931, now seen corresponding path program 1 times [2020-06-22 10:35:42,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:42,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:42,311 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:35:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,313 INFO L87 Difference]: Start difference. First operand 40 states and 79 transitions. Second operand 3 states. [2020-06-22 10:35:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:42,427 INFO L93 Difference]: Finished difference Result 40 states and 79 transitions. [2020-06-22 10:35:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:42,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:35:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:42,428 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:35:42,428 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 10:35:42,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 10:35:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 10:35:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 10:35:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2020-06-22 10:35:42,433 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 65 transitions. Word has length 5 [2020-06-22 10:35:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:42,433 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 65 transitions. [2020-06-22 10:35:42,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 65 transitions. [2020-06-22 10:35:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:35:42,434 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:42,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,435 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 97201123, now seen corresponding path program 1 times [2020-06-22 10:35:42,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:42,463 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:35:42,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:42,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:42,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,464 INFO L87 Difference]: Start difference. First operand 33 states and 65 transitions. Second operand 3 states. [2020-06-22 10:35:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:42,577 INFO L93 Difference]: Finished difference Result 33 states and 65 transitions. [2020-06-22 10:35:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:42,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:35:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:42,578 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:35:42,578 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:35:42,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:35:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:35:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:35:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2020-06-22 10:35:42,583 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 55 transitions. Word has length 6 [2020-06-22 10:35:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:42,583 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 55 transitions. [2020-06-22 10:35:42,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 55 transitions. [2020-06-22 10:35:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:35:42,583 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:35:42,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,584 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-06-22 10:35:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 97201124, now seen corresponding path program 1 times [2020-06-22 10:35:42,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:42,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:42,617 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:35:42,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:42,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:35:42,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:35:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:35:42,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,619 INFO L87 Difference]: Start difference. First operand 28 states and 55 transitions. Second operand 3 states. [2020-06-22 10:35:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:42,734 INFO L93 Difference]: Finished difference Result 28 states and 55 transitions. [2020-06-22 10:35:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:35:42,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:35:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:35:42,736 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:35:42,736 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:35:42,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:35:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:35:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:35:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:35:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:35:42,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 10:35:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:35:42,737 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:35:42,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:35:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:35:42,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:35:42,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:35:42,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:35:42,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:35:42,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:35:42,893 INFO L444 ceAbstractionStarter]: At program point L27(lines 6 30) the Hoare annotation is: (and (= 0 ULTIMATE.start_f_~j~0.offset) (= 0 ULTIMATE.start_f_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= (select |#length| ULTIMATE.start_f_~j~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~k_ref~0.base) 4)) [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:35:42,894 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 21) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:35:42,895 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:35:42,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L444 ceAbstractionStarter]: At program point L25(lines 22 28) the Hoare annotation is: (and (= 0 ULTIMATE.start_f_~j~0.offset) (= 0 ULTIMATE.start_f_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= (select |#length| ULTIMATE.start_f_~j~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~k_ref~0.base) 4)) [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:35:42,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 19) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:35:42,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:35:42,899 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 10:35:42,899 INFO L444 ceAbstractionStarter]: At program point L22(lines 6 30) the Hoare annotation is: (and (= 0 ULTIMATE.start_f_~j~0.offset) (= 0 ULTIMATE.start_f_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= (select |#length| ULTIMATE.start_f_~j~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~k_ref~0.base) 4)) [2020-06-22 10:35:42,899 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 28) no Hoare annotation was computed. [2020-06-22 10:35:42,899 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 28) no Hoare annotation was computed. [2020-06-22 10:35:42,899 INFO L444 ceAbstractionStarter]: At program point L18(lines 15 21) the Hoare annotation is: (and (= 0 ULTIMATE.start_f_~j~0.offset) (= 0 ULTIMATE.start_f_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~k_ref~0.base)) (= 0 ULTIMATE.start_f_~k_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_f_~l_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~i~0.base)) (= 0 ULTIMATE.start_f_~l_ref~0.offset) (= (select |#length| ULTIMATE.start_f_~j~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_f_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~l_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~k_ref~0.base) 4)) [2020-06-22 10:35:42,899 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:35:42,900 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:35:42,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:35:42,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:35:42 BasicIcfg [2020-06-22 10:35:42,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:35:42,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:35:42,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:35:42,934 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:35:42,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:35:42,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:35:39" (1/5) ... [2020-06-22 10:35:42,935 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c8c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:35:42, skipping insertion in model container [2020-06-22 10:35:42,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:35:42,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:39" (2/5) ... [2020-06-22 10:35:42,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c8c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:35:42, skipping insertion in model container [2020-06-22 10:35:42,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:35:42,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:40" (3/5) ... [2020-06-22 10:35:42,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c8c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:35:42, skipping insertion in model container [2020-06-22 10:35:42,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:35:42,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:35:40" (4/5) ... [2020-06-22 10:35:42,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c8c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:35:42, skipping insertion in model container [2020-06-22 10:35:42,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:35:42,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:35:42" (5/5) ... [2020-06-22 10:35:42,939 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:35:42,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:35:42,960 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:35:42,960 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:35:42,960 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:35:42,960 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:35:42,961 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:35:42,961 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:35:42,961 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:35:42,961 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:35:42,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-06-22 10:35:42,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:42,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:42,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:42,976 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,977 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,977 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:35:42,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-06-22 10:35:42,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:42,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:42,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:42,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:42,986 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 8#L-1true [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 26#L11true [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 22#L11-1true [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 39#L12true [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 52#L13true [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 33#L27true [2020-06-22 10:35:42,987 INFO L796 eck$LassoCheckResult]: Loop: 33#L27true [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4#L18true [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 16#L15true [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 30#L15-1true [175] L15-1-->L22: Formula: (>= |v_ULTIMATE.start_f_#t~mem4_4| |v_ULTIMATE.start_f_#t~mem5_4|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_4|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 28#L22true [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14#L25true [104] L25-->L22-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 23#L22-1true [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 41#L23true [311] L23-->L23-2: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 37#L23-2true [313] L23-2-->L24: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15) (= (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20) 1) (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 54#L24true [155] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 51#L24-1true [306] L24-1-->L27: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem12_6| 2)) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_6|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 33#L27true [2020-06-22 10:35:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 111053866, now seen corresponding path program 1 times [2020-06-22 10:35:42,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:42,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:42,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1299202843, now seen corresponding path program 1 times [2020-06-22 10:35:43,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:43,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:43,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:43,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash -101338286, now seen corresponding path program 1 times [2020-06-22 10:35:43,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:43,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:43,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:43,717 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2020-06-22 10:35:43,959 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-06-22 10:35:43,973 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:35:43,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:35:43,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:35:43,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:35:43,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:35:43,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:35:43,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:35:43,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:35:43,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:35:43,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:35:43,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:35:43,998 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:35:44,004 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:35:44,006 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:35:44,010 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:35:44,016 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:35:44,021 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:35:44,456 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-06-22 10:35:44,588 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-06-22 10:35:44,589 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:35:44,590 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:35:44,593 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:35:44,594 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:35:44,596 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:35:44,598 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:35:44,608 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:35:44,610 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:35:44,612 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:35:44,613 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:35:44,614 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:35:44,616 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:35:45,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:35:45,095 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:35:45,098 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:35:45,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:45,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:45,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:45,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,105 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:35:45,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:45,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:45,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:45,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,107 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:35:45,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,113 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:35:45,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:45,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:45,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:45,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,116 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:35:45,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:45,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:45,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:45,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,118 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:35:45,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,135 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:35:45,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,146 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:35:45,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,155 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:35:45,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,161 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:35:45,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,168 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:35:45,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,173 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:35:45,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,202 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:35:45,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,210 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:35:45,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,217 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:35:45,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:45,227 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:35:45,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:45,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:45,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:45,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:45,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:45,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:45,235 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:35:45,239 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:35:45,239 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:35:45,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:35:45,243 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:35:45,243 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:35:45,244 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2020-06-22 10:35:45,377 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-06-22 10:35:45,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:35:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:45,534 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,548 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:45,550 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,550 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:45,578 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:35:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:45,645 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,654 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:45,655 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,656 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,717 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:45,719 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,729 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:45,730 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,730 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:45,784 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:35:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:45,800 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:35:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:45,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:45,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:45,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:45,860 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,869 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:45,870 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:45,871 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:45,901 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:35:45,905 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 5 loop predicates [2020-06-22 10:35:45,906 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 53 states. Second operand 7 states. [2020-06-22 10:35:46,367 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 53 states.. Second operand 7 states. Result 214 states and 455 transitions. Complement of second has 14 states. [2020-06-22 10:35:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 10:35:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:35:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2020-06-22 10:35:46,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 346 transitions. Stem has 6 letters. Loop has 11 letters. [2020-06-22 10:35:46,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:46,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 346 transitions. Stem has 17 letters. Loop has 11 letters. [2020-06-22 10:35:46,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:46,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 346 transitions. Stem has 6 letters. Loop has 22 letters. [2020-06-22 10:35:46,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:46,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 455 transitions. [2020-06-22 10:35:46,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:46,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 51 states and 78 transitions. [2020-06-22 10:35:46,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-06-22 10:35:46,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-06-22 10:35:46,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 78 transitions. [2020-06-22 10:35:46,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:46,400 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 78 transitions. [2020-06-22 10:35:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 78 transitions. [2020-06-22 10:35:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2020-06-22 10:35:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 10:35:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2020-06-22 10:35:46,404 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 65 transitions. [2020-06-22 10:35:46,404 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 65 transitions. [2020-06-22 10:35:46,404 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:35:46,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 65 transitions. [2020-06-22 10:35:46,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:46,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:46,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:46,406 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:46,406 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:46,407 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 648#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 649#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 650#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 651#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 664#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 667#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 644#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 634#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 635#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 638#L16 [2020-06-22 10:35:46,407 INFO L796 eck$LassoCheckResult]: Loop: 638#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 639#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 647#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 640#L17-1 [272] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_f_#t~mem8_4| 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 641#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 671#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 670#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 638#L16 [2020-06-22 10:35:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1057256855, now seen corresponding path program 1 times [2020-06-22 10:35:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1532596591, now seen corresponding path program 1 times [2020-06-22 10:35:46,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:46,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:46,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1220032743, now seen corresponding path program 1 times [2020-06-22 10:35:46,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:35:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 10:35:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:35:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:35:46,677 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. cyclomatic complexity: 29 Second operand 8 states. [2020-06-22 10:35:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:46,987 INFO L93 Difference]: Finished difference Result 55 states and 88 transitions. [2020-06-22 10:35:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:35:46,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 88 transitions. [2020-06-22 10:35:46,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2020-06-22 10:35:46,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 88 transitions. [2020-06-22 10:35:46,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-06-22 10:35:47,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-22 10:35:47,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 88 transitions. [2020-06-22 10:35:47,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:47,000 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 88 transitions. [2020-06-22 10:35:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 88 transitions. [2020-06-22 10:35:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-06-22 10:35:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 10:35:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2020-06-22 10:35:47,003 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 71 transitions. [2020-06-22 10:35:47,003 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 71 transitions. [2020-06-22 10:35:47,003 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:35:47,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 71 transitions. [2020-06-22 10:35:47,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:47,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:47,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:47,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:47,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:47,006 INFO L794 eck$LassoCheckResult]: Stem: 773#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 761#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 762#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 763#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 764#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 777#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 781#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 760#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 746#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 747#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 783#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 787#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 786#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 752#L17-1 [285] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 753#L18 [2020-06-22 10:35:47,007 INFO L796 eck$LassoCheckResult]: Loop: 753#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 785#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 784#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 750#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 751#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 758#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 759#L17-1 [272] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_f_#t~mem8_4| 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 753#L18 [2020-06-22 10:35:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1767708830, now seen corresponding path program 1 times [2020-06-22 10:35:47,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:47,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1568650667, now seen corresponding path program 2 times [2020-06-22 10:35:47,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:47,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -127078614, now seen corresponding path program 1 times [2020-06-22 10:35:47,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:47,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:35:47,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:35:47,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/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:35:47,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:47,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:35:47,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:47,217 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-06-22 10:35:47,218 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,224 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,225 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,225 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-06-22 10:35:47,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 10:35:47,231 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,237 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-06-22 10:35:47,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:35:47,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:35:47,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,258 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:47,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2020-06-22 10:35:47,312 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2020-06-22 10:35:47,313 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:47,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2020-06-22 10:35:47,375 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2020-06-22 10:35:47,376 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,384 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,385 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:47,385 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2020-06-22 10:35:47,409 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-06-22 10:35:47,409 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,413 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:47,413 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:47,414 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-06-22 10:35:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:35:47,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:35:47,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-06-22 10:35:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 10:35:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-06-22 10:35:47,548 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. cyclomatic complexity: 31 Second operand 16 states. [2020-06-22 10:35:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:48,147 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-06-22 10:35:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-06-22 10:35:48,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 113 transitions. [2020-06-22 10:35:48,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 10:35:48,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 113 transitions. [2020-06-22 10:35:48,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2020-06-22 10:35:48,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-06-22 10:35:48,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 113 transitions. [2020-06-22 10:35:48,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:48,160 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 113 transitions. [2020-06-22 10:35:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 113 transitions. [2020-06-22 10:35:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 38. [2020-06-22 10:35:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 10:35:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2020-06-22 10:35:48,163 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 64 transitions. [2020-06-22 10:35:48,163 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 64 transitions. [2020-06-22 10:35:48,163 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:35:48,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 64 transitions. [2020-06-22 10:35:48,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:35:48,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:48,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:48,165 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:48,165 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:48,166 INFO L794 eck$LassoCheckResult]: Stem: 997#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 985#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 986#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 987#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 988#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 1001#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1005#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1008#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1009#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1007#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 979#L16 [2020-06-22 10:35:48,166 INFO L796 eck$LassoCheckResult]: Loop: 979#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 980#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 984#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 976#L17-1 [277] L17-1-->L18: Formula: (and (>= |v_ULTIMATE.start_f_#t~mem8_4| 0) (< 0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 977#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 972#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 973#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 979#L16 [2020-06-22 10:35:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1057256855, now seen corresponding path program 2 times [2020-06-22 10:35:48,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:48,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1532745546, now seen corresponding path program 1 times [2020-06-22 10:35:48,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1219883788, now seen corresponding path program 1 times [2020-06-22 10:35:48,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:48,928 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2020-06-22 10:35:49,306 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-06-22 10:35:49,310 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:35:49,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:35:49,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:35:49,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:35:49,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:35:49,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:35:49,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:35:49,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:35:49,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:35:49,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:35:49,311 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:35:49,315 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:35:49,318 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:35:49,782 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2020-06-22 10:35:49,900 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-06-22 10:35:49,901 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:35:49,903 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:35:49,905 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:35:49,906 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:35:49,909 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:35:49,910 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:35:49,913 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:35:49,916 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:35:49,918 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:35:49,920 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:35:49,922 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:35:49,923 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:35:49,925 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:35:49,927 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:35:49,929 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:35:49,931 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:35:50,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:35:50,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:35:50,382 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:35:50,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:50,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:50,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:50,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,385 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:35:50,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,389 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:35:50,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,394 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:35:50,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,399 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:35:50,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,404 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:35:50,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,410 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:35:50,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,413 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:35:50,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,428 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:35:50,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,434 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:35:50,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,438 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:35:50,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,441 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:35:50,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,446 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:35:50,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,452 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:35:50,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:50,455 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:35:50,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:50,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:50,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:50,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:50,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:50,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:50,472 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:35:50,489 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:35:50,489 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:35:50,490 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:35:50,491 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:35:50,491 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:35:50,491 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 Supporting invariants [] [2020-06-22 10:35:50,614 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-06-22 10:35:50,616 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:35:50,616 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:35:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:50,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:35:50,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:50,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:35:50,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:50,687 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:50,688 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 10:35:50,696 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:50,739 INFO L497 ElimStorePlain]: treesize reduction 47, result has 39.0 percent of original size [2020-06-22 10:35:50,740 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:35:50,740 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-06-22 10:35:50,804 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:35:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:50,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:35:50,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:50,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:35:50,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:51,022 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:51,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 10:35:51,029 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:51,061 INFO L497 ElimStorePlain]: treesize reduction 37, result has 45.6 percent of original size [2020-06-22 10:35:51,062 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:51,062 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2020-06-22 10:35:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,150 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:35:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,157 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:35:51,157 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-06-22 10:35:51,157 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 11 loop predicates [2020-06-22 10:35:51,158 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 38 states and 64 transitions. cyclomatic complexity: 28 Second operand 6 states. [2020-06-22 10:35:51,828 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 38 states and 64 transitions. cyclomatic complexity: 28. Second operand 6 states. Result 262 states and 346 transitions. Complement of second has 99 states. [2020-06-22 10:35:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 14 non-accepting loop states 3 accepting loop states [2020-06-22 10:35:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:35:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2020-06-22 10:35:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 94 transitions. Stem has 10 letters. Loop has 7 letters. [2020-06-22 10:35:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 94 transitions. Stem has 17 letters. Loop has 7 letters. [2020-06-22 10:35:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 94 transitions. Stem has 10 letters. Loop has 14 letters. [2020-06-22 10:35:51,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:51,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 346 transitions. [2020-06-22 10:35:51,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2020-06-22 10:35:51,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 119 states and 165 transitions. [2020-06-22 10:35:51,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2020-06-22 10:35:51,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2020-06-22 10:35:51,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 165 transitions. [2020-06-22 10:35:51,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:51,845 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 165 transitions. [2020-06-22 10:35:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 165 transitions. [2020-06-22 10:35:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 48. [2020-06-22 10:35:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 10:35:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2020-06-22 10:35:51,849 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 77 transitions. [2020-06-22 10:35:51,849 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 77 transitions. [2020-06-22 10:35:51,849 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:35:51,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 77 transitions. [2020-06-22 10:35:51,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 10:35:51,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:51,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:51,850 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:51,850 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:51,851 INFO L794 eck$LassoCheckResult]: Stem: 1694#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1682#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 1683#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 1684#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1685#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 1698#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1702#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1706#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1710#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1707#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 1667#L16 [2020-06-22 10:35:51,852 INFO L796 eck$LassoCheckResult]: Loop: 1667#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 1669#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 1680#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1671#L17-1 [287] L17-1-->L22: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem8_6| 2)) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1673#L22 [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1695#L25 [104] L25-->L22-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 1690#L22-1 [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 1691#L23 [311] L23-->L23-2: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 1686#L23-2 [313] L23-2-->L24: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15) (= (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20) 1) (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 1687#L24 [155] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 1703#L24-1 [306] L24-1-->L27: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem12_6| 2)) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_6|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 1676#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1677#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1708#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1709#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 1667#L16 [2020-06-22 10:35:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1057256855, now seen corresponding path program 3 times [2020-06-22 10:35:51,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash 214386491, now seen corresponding path program 1 times [2020-06-22 10:35:51,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:51,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash 992096997, now seen corresponding path program 1 times [2020-06-22 10:35:51,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:35:51,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:35:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:35:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:35:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:35:52,124 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. cyclomatic complexity: 31 Second operand 7 states. [2020-06-22 10:35:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:52,379 INFO L93 Difference]: Finished difference Result 76 states and 114 transitions. [2020-06-22 10:35:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:35:52,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 114 transitions. [2020-06-22 10:35:52,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2020-06-22 10:35:52,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 114 transitions. [2020-06-22 10:35:52,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-06-22 10:35:52,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-06-22 10:35:52,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 114 transitions. [2020-06-22 10:35:52,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:52,389 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 114 transitions. [2020-06-22 10:35:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 114 transitions. [2020-06-22 10:35:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-06-22 10:35:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 10:35:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2020-06-22 10:35:52,393 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-06-22 10:35:52,393 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-06-22 10:35:52,393 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:35:52,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 83 transitions. [2020-06-22 10:35:52,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 10:35:52,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:52,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:52,394 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:52,395 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:52,395 INFO L794 eck$LassoCheckResult]: Stem: 1835#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1823#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 1824#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 1825#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1826#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 1840#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1844#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1850#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1853#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1846#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 1807#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 1809#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 1847#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1812#L17-1 [285] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1813#L18 [2020-06-22 10:35:52,396 INFO L796 eck$LassoCheckResult]: Loop: 1813#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1803#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1804#L15-1 [175] L15-1-->L22: Formula: (>= |v_ULTIMATE.start_f_#t~mem4_4| |v_ULTIMATE.start_f_#t~mem5_4|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_4|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 1836#L22 [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1837#L25 [104] L25-->L22-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 1827#L22-1 [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 1828#L23 [311] L23-->L23-2: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 1831#L23-2 [313] L23-2-->L24: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15) (= (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20) 1) (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 1832#L24 [155] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 1845#L24-1 [306] L24-1-->L27: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem12_6| 2)) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_6|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 1816#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1817#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 1854#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 1852#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 1851#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 1811#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 1820#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1821#L17-1 [277] L17-1-->L18: Formula: (and (>= |v_ULTIMATE.start_f_#t~mem8_4| 0) (< 0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 1813#L18 [2020-06-22 10:35:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1767708830, now seen corresponding path program 2 times [2020-06-22 10:35:52,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:52,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -84384148, now seen corresponding path program 1 times [2020-06-22 10:35:52,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1730242675, now seen corresponding path program 1 times [2020-06-22 10:35:52,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:52,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:52,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:35:52,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:35:52,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:35:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:52,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 10:35:52,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:52,633 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-06-22 10:35:52,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,640 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:52,640 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,641 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-06-22 10:35:52,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-06-22 10:35:52,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:52,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,663 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2020-06-22 10:35:52,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 10:35:52,719 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,727 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:52,727 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,728 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2020-06-22 10:35:52,745 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-06-22 10:35:52,745 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,747 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:52,747 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:35:52,748 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-06-22 10:35:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:35:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:35:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2020-06-22 10:35:52,994 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-06-22 10:35:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 10:35:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:35:53,041 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. cyclomatic complexity: 33 Second operand 15 states. [2020-06-22 10:35:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:35:53,624 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2020-06-22 10:35:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 10:35:53,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 122 transitions. [2020-06-22 10:35:53,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2020-06-22 10:35:53,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 59 states and 90 transitions. [2020-06-22 10:35:53,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-06-22 10:35:53,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-06-22 10:35:53,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 90 transitions. [2020-06-22 10:35:53,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:53,634 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 90 transitions. [2020-06-22 10:35:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 90 transitions. [2020-06-22 10:35:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2020-06-22 10:35:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 10:35:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2020-06-22 10:35:53,637 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 88 transitions. [2020-06-22 10:35:53,637 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 88 transitions. [2020-06-22 10:35:53,637 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:35:53,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 88 transitions. [2020-06-22 10:35:53,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2020-06-22 10:35:53,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:53,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:53,638 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:53,639 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:35:53,639 INFO L794 eck$LassoCheckResult]: Stem: 2095#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2087#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 2088#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 2089#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 2090#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 2098#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 2100#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2106#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 2105#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 2103#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 2104#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 2102#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 2085#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2079#L17-1 [285] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2080#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 2117#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 2101#L15-1 [175] L15-1-->L22: Formula: (>= |v_ULTIMATE.start_f_#t~mem4_4| |v_ULTIMATE.start_f_#t~mem5_4|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_4|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_3|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 2096#L22 [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2097#L25 [2020-06-22 10:35:53,640 INFO L796 eck$LassoCheckResult]: Loop: 2097#L25 [104] L25-->L22-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 2091#L22-1 [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 2092#L23 [311] L23-->L23-2: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 2093#L23-2 [313] L23-2-->L24: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15) (= (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20) 1) (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 2094#L24 [155] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 2099#L24-1 [292] L24-1-->L25: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem12_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0))) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_4|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 2097#L25 [2020-06-22 10:35:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 845698105, now seen corresponding path program 1 times [2020-06-22 10:35:53,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:53,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -314256105, now seen corresponding path program 1 times [2020-06-22 10:35:53,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -814014641, now seen corresponding path program 1 times [2020-06-22 10:35:53,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:53,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:53,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:54,817 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 158 DAG size of output: 131 [2020-06-22 10:35:55,163 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-06-22 10:35:55,166 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:35:55,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:35:55,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:35:55,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:35:55,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:35:55,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:35:55,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:35:55,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:35:55,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:35:55,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:35:55,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:35:55,170 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:35:55,173 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:35:55,175 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:35:55,177 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:35:55,179 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:35:55,181 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:35:55,182 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:35:55,622 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2020-06-22 10:35:55,724 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:35:55,726 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:35:55,728 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:35:55,729 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:35:55,731 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:35:55,732 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:35:55,733 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:35:55,735 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:35:55,736 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:35:55,738 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:35:55,739 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:35:56,169 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:35:56,170 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:35:56,170 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:35:56,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,174 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:35:56,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:56,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:56,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:56,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,176 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:35:56,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,178 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:35:56,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:56,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:56,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:56,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,180 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:35:56,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:56,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:56,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:56,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,182 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:35:56,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:35:56,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:35:56,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:35:56,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,184 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:35:56,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,191 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:35:56,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,195 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:35:56,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,199 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:35:56,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,203 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:35:56,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,209 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:35:56,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,212 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:35:56,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:35:56,215 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:35:56,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:35:56,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:35:56,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:35:56,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:35:56,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:35:56,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:35:56,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:35:56,223 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:35:56,224 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:35:56,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:35:56,225 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:35:56,225 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:35:56,225 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_3 + 1 Supporting invariants [] [2020-06-22 10:35:56,343 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-06-22 10:35:56,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:35:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:56,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:35:56,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:56,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:56,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:56,444 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:56,445 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:56,452 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:56,453 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:56,453 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:56,470 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:35:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,520 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:35:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:56,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:56,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:35:56,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:35:56,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:35:56,565 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:35:56,567 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:56,576 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:35:56,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:35:56,577 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:35:56,603 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:35:56,604 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 5 loop predicates [2020-06-22 10:35:56,604 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 57 states and 88 transitions. cyclomatic complexity: 34 Second operand 6 states. [2020-06-22 10:35:56,706 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 57 states and 88 transitions. cyclomatic complexity: 34. Second operand 6 states. Result 90 states and 131 transitions. Complement of second has 12 states. [2020-06-22 10:35:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:35:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:35:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2020-06-22 10:35:56,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 18 letters. Loop has 6 letters. [2020-06-22 10:35:56,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:56,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 24 letters. Loop has 6 letters. [2020-06-22 10:35:56,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:56,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 18 letters. Loop has 12 letters. [2020-06-22 10:35:56,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:35:56,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 131 transitions. [2020-06-22 10:35:56,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-22 10:35:56,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 37 states and 58 transitions. [2020-06-22 10:35:56,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:35:56,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:35:56,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 58 transitions. [2020-06-22 10:35:56,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:35:56,717 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 58 transitions. [2020-06-22 10:35:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 58 transitions. [2020-06-22 10:35:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-06-22 10:35:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:35:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-06-22 10:35:56,719 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-06-22 10:35:56,719 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-06-22 10:35:56,719 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:35:56,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 56 transitions. [2020-06-22 10:35:56,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-06-22 10:35:56,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:35:56,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:35:56,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:56,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:35:56,722 INFO L794 eck$LassoCheckResult]: Stem: 2525#ULTIMATE.startENTRY [116] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2517#L-1 [210] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~j~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~l_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~i~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_f_~k_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~i~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~j~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~l_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_1, ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_1, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_1, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_1, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_1, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_1, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_1|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_1, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_~k, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_#t~post11, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_#t~mem12, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 2518#L11 [117] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~k_ref~0.base_3) v_ULTIMATE.start_f_~k_ref~0.offset_3 v_ULTIMATE.start_f_~k_3))) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~k_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_f_~k_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_3, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 2519#L11-1 [111] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~l_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~l_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~l_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~l_ref~0.base_3) v_ULTIMATE.start_f_~l_ref~0.offset_3 v_ULTIMATE.start_f_~l_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~l_ref~0.base_3))) InVars {ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~l_ref~0.offset=v_ULTIMATE.start_f_~l_ref~0.offset_3, ULTIMATE.start_f_~l_ref~0.base=v_ULTIMATE.start_f_~l_ref~0.base_3, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 2520#L12 [135] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~i~0.offset_3) (<= (+ v_ULTIMATE.start_f_~i~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~i~0.base_3)) (= (select |v_#valid_12| v_ULTIMATE.start_f_~i~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~i~0.base_3) v_ULTIMATE.start_f_~i~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_3, #length=|v_#length_10|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 2527#L13 [152] L13-->L27: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~j~0.base_3)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~j~0.base_3)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~j~0.base_3) v_ULTIMATE.start_f_~j~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_3, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 2531#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2535#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 2534#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 2532#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 2509#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 2510#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 2516#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2507#L17-1 [285] L17-1-->L18: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_f_#t~mem8_4| 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_4|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2508#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 2503#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 2504#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 2511#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 2512#L16-2 [2020-06-22 10:35:56,722 INFO L796 eck$LassoCheckResult]: Loop: 2512#L16-2 [310] L16-2-->L17: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_f_~i~0.base_25) 1) (<= 0 v_ULTIMATE.start_f_~i~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_f_~i~0.base_25) v_ULTIMATE.start_f_~i~0.offset_18 (+ |v_ULTIMATE.start_f_#t~post7_7| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_f_~i~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_f_~i~0.base_25))) InVars {ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_7|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_6|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_25, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_18, #length=|v_#length_37|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6, #memory_int] 2515#L17 [147] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~i~0.base_15) v_ULTIMATE.start_f_~i~0.offset_11)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~i~0.base_15)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_f_~i~0.base_15)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_11, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2505#L17-1 [287] L17-1-->L22: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem8_6| 2)) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 2506#L22 [120] L22-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2526#L25 [104] L25-->L22-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~j~0.base_6)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_f_~j~0.base_6) v_ULTIMATE.start_f_~j~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~j~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~j~0.base_6))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_6, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 2521#L22-1 [115] L22-1-->L23: Formula: (< |v_ULTIMATE.start_f_#t~mem9_6| 1) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 2522#L23 [311] L23-->L23-2: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_f_~j~0.base_18) 1) (= |v_ULTIMATE.start_f_#t~mem10_5| |v_ULTIMATE.start_f_#t~post11_5|) (<= (+ v_ULTIMATE.start_f_~j~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_f_~j~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem10_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~j~0.base_18) v_ULTIMATE.start_f_~j~0.offset_13)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_13)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_18, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11] 2523#L23-2 [313] L23-2-->L24: Formula: (and (<= (+ v_ULTIMATE.start_f_~j~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_f_~j~0.base_20)) (<= 0 v_ULTIMATE.start_f_~j~0.offset_15) (= (select |v_#valid_48| v_ULTIMATE.start_f_~j~0.base_20) 1) (= (store |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20 (store (select |v_#memory_int_28| v_ULTIMATE.start_f_~j~0.base_20) v_ULTIMATE.start_f_~j~0.offset_15 (+ |v_ULTIMATE.start_f_#t~post11_7| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_7|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~j~0.base=v_ULTIMATE.start_f_~j~0.base_20, ULTIMATE.start_f_#t~post11=|v_ULTIMATE.start_f_#t~post11_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_40|, ULTIMATE.start_f_~j~0.offset=v_ULTIMATE.start_f_~j~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~post11, #memory_int] 2524#L24 [155] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_f_~i~0.base_18)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_13) (<= (+ v_ULTIMATE.start_f_~i~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_f_~i~0.base_18)) (= |v_ULTIMATE.start_f_#t~mem12_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~i~0.base_18) v_ULTIMATE.start_f_~i~0.offset_13))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_18, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 2528#L24-1 [306] L24-1-->L27: Formula: (= 0 (mod |v_ULTIMATE.start_f_#t~mem12_6| 2)) InVars {ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_6|} OutVars{ULTIMATE.start_f_#t~mem12=|v_ULTIMATE.start_f_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem12] 2513#L27 [129] L27-->L18: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2514#L18 [93] L18-->L15: Formula: (and (= |v_ULTIMATE.start_f_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~i~0.base_6) v_ULTIMATE.start_f_~i~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~i~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_f_~i~0.base_6)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~i~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_6, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_5, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4] 2501#L15 [107] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_f_~k_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~k_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_f_~k_ref~0.base_6) v_ULTIMATE.start_f_~k_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~k_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_f_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_f_~k_ref~0.offset=v_ULTIMATE.start_f_~k_ref~0.offset_5, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_2|, ULTIMATE.start_f_~k_ref~0.base=v_ULTIMATE.start_f_~k_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 2502#L15-1 [124] L15-1-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem4_6| |v_ULTIMATE.start_f_#t~mem5_6|) InVars {ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_6|} OutVars{ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#t~mem5] 2533#L16 [309] L16-->L16-2: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_5| (select (select |v_#memory_int_22| v_ULTIMATE.start_f_~i~0.base_24) v_ULTIMATE.start_f_~i~0.offset_17)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_f_~i~0.base_24)) (<= (+ v_ULTIMATE.start_f_~i~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_f_~i~0.base_24)) (= |v_ULTIMATE.start_f_#t~mem6_5| |v_ULTIMATE.start_f_#t~post7_5|) (<= 0 v_ULTIMATE.start_f_~i~0.offset_17)) InVars {ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} OutVars{ULTIMATE.start_f_#t~post7=|v_ULTIMATE.start_f_#t~post7_5|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_~i~0.base=v_ULTIMATE.start_f_~i~0.base_24, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_f_~i~0.offset=v_ULTIMATE.start_f_~i~0.offset_17, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post7, ULTIMATE.start_f_#t~mem6] 2512#L16-2 [2020-06-22 10:35:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 845696713, now seen corresponding path program 3 times [2020-06-22 10:35:56,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:35:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -671558899, now seen corresponding path program 2 times [2020-06-22 10:35:56,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:35:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 874519365, now seen corresponding path program 1 times [2020-06-22 10:35:56,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:35:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:35:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:35:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:35:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:35:58,133 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 162 DAG size of output: 143 [2020-06-22 10:35:58,898 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-06-22 10:35:58,903 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:35:58,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:35:58,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:35:58,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:35:58,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:35:58,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:35:58,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:35:58,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:35:58,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:35:58,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:35:58,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:35:58,907 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:35:58,910 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:35:58,911 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:35:58,913 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:35:58,915 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:35:58,917 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:35:58,919 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:35:58,920 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:35:58,922 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:35:58,924 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:35:58,925 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:35:58,927 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:35:58,929 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:35:59,562 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2020-06-22 10:35:59,723 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2020-06-22 10:35:59,723 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:35:59,725 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:35:59,727 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:35:59,728 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:35:59,730 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:36:00,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:36:00,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:36:00,281 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:36:00,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,283 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:36:00,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,285 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:36:00,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,287 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:36:00,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,289 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:36:00,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,291 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:36:00,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,294 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:36:00,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,295 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:36:00,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,298 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:36:00,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,299 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:36:00,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,301 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:36:00,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,303 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:36:00,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:36:00,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:36:00,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:36:00,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,304 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:36:00,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,309 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:36:00,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,313 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:36:00,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,320 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:36:00,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,324 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:36:00,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:36:00,327 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:36:00,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:36:00,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:36:00,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:36:00,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:36:00,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:36:00,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:36:00,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:36:00,334 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:36:00,335 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:36:00,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:36:00,335 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:36:00,336 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:36:00,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_4 + 1 Supporting invariants [] [2020-06-22 10:36:00,499 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-06-22 10:36:00,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:36:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:36:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:00,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:36:00,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:00,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:36:00,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:00,570 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:00,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 50 [2020-06-22 10:36:00,572 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:00,596 INFO L497 ElimStorePlain]: treesize reduction 18, result has 64.0 percent of original size [2020-06-22 10:36:00,597 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:00,597 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2020-06-22 10:36:00,947 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-06-22 10:36:01,315 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-06-22 10:36:01,696 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-06-22 10:36:02,063 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-06-22 10:36:02,449 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 10:36:02,480 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:02,481 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 70 [2020-06-22 10:36:02,486 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:36:02,573 INFO L497 ElimStorePlain]: treesize reduction 42, result has 71.4 percent of original size [2020-06-22 10:36:02,577 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2020-06-22 10:36:02,578 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:36:02,613 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:02,614 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-06-22 10:36:02,614 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:89 [2020-06-22 10:36:03,430 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-06-22 10:36:03,827 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-06-22 10:36:03,934 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:36:04,265 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_22 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_22)))) (<= 1 (+ c_oldRank0 (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_f_~j~0.base) c_ULTIMATE.start_f_~j~0.offset))))) is different from true [2020-06-22 10:36:04,748 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_22 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_22)))) (<= 3 (+ c_oldRank0 (* 2 (select (select |c_#memory_int| c_ULTIMATE.start_f_~j~0.base) c_ULTIMATE.start_f_~j~0.offset))))) is different from true [2020-06-22 10:36:07,112 WARN L860 $PredicateComparison]: unable to prove that (or (<= (mod (select (select |c_#memory_int| c_ULTIMATE.start_f_~i~0.base) c_ULTIMATE.start_f_~i~0.offset) 2) 0) (exists ((v_arrayElimCell_22 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_22))))) is different from true [2020-06-22 10:36:07,399 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_f_~j~0.offset c_ULTIMATE.start_f_~i~0.offset)) (exists ((v_arrayElimCell_22 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_22)))) (not (= c_ULTIMATE.start_f_~i~0.base c_ULTIMATE.start_f_~j~0.base))) is different from true [2020-06-22 10:36:08,617 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_22 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_22)))) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) (and (<= (mod .cse0 2) 0) (not (= c_ULTIMATE.start_f_~j~0.offset ULTIMATE.start_f_~i~0.offset)) (= .cse0 |c_ULTIMATE.start_f_#t~mem12|)))) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (let ((.cse1 (select (select |c_#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) (and (<= (mod .cse1 2) 0) (not (= ULTIMATE.start_f_~i~0.base c_ULTIMATE.start_f_~j~0.base)) (= .cse1 |c_ULTIMATE.start_f_#t~mem12|))))) is different from true [2020-06-22 10:36:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:08,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:36:08,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:08,867 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:36:08,868 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:08,875 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:08,876 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:08,876 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:36:09,003 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:09,004 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 [2020-06-22 10:36:09,007 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:36:09,058 INFO L497 ElimStorePlain]: treesize reduction 35, result has 59.3 percent of original size [2020-06-22 10:36:09,060 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:09,060 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:46 [2020-06-22 10:36:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:24,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:36:24,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:24,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 10:36:24,304 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:24,305 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:24,305 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:24,306 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-06-22 10:36:24,736 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 Int)) (<= 1 (+ (* 2 v_arrayElimCell_29) c_oldRank0))) is different from true [2020-06-22 10:36:25,239 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-06-22 10:36:25,936 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-06-22 10:36:26,313 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-06-22 10:36:26,319 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-06-22 10:36:26,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:36:26,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:26,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:26,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2020-06-22 10:36:26,700 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-06-22 10:36:27,140 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-06-22 10:36:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:28,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:36:28,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:28,511 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 10:36:28,511 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:28,513 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:28,513 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:28,513 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-06-22 10:36:28,943 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_31 Int)) (<= 1 (+ c_oldRank0 (* 2 v_arrayElimCell_31)))) is different from true [2020-06-22 10:36:28,994 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-06-22 10:36:28,994 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:36:28,999 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:29,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:29,000 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2020-06-22 10:36:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:29,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:36:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:29,093 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:29,093 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 [2020-06-22 10:36:29,098 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:29,149 INFO L497 ElimStorePlain]: treesize reduction 26, result has 69.8 percent of original size [2020-06-22 10:36:29,151 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-06-22 10:36:29,151 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:53 [2020-06-22 10:36:48,287 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 37 [2020-06-22 10:36:49,920 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (not (and (= c_ULTIMATE.start_f_~j~0.offset v_prenex_5) (= v_prenex_6 c_ULTIMATE.start_f_~j~0.base)))) (exists ((v_prenex_4 Int) (ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (<= 1 (+ (* 2 v_prenex_4) c_oldRank0)) (<= (+ v_prenex_4 1) (select (select |c_#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (or (and (= ULTIMATE.start_f_~i~0.base c_ULTIMATE.start_f_~j~0.base) (= c_ULTIMATE.start_f_~j~0.offset ULTIMATE.start_f_~i~0.offset)) (= (select (select |c_#memory_int| c_ULTIMATE.start_f_~j~0.base) c_ULTIMATE.start_f_~j~0.offset) v_prenex_4))))) is different from true [2020-06-22 10:36:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:36:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:36:49,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:36:49,970 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:36:49,970 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 [2020-06-22 10:36:49,974 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:36:50,028 INFO L497 ElimStorePlain]: treesize reduction 26, result has 69.8 percent of original size [2020-06-22 10:36:50,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-06-22 10:36:50,030 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:53 [2020-06-22 10:37:19,694 WARN L188 SmtUtils]: Spent 3.10 s on a formula simplification that was a NOOP. DAG size: 37 [2020-06-22 10:37:19,708 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:37:19,709 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:19,716 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:19,717 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:19,717 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:37:21,404 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 Int) (ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (<= 1 (+ (* 2 v_prenex_7) c_oldRank0)) (<= (+ v_prenex_7 1) (select (select |c_#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (or (and (= ULTIMATE.start_f_~i~0.base c_ULTIMATE.start_f_~j~0.base) (= c_ULTIMATE.start_f_~j~0.offset ULTIMATE.start_f_~i~0.offset)) (= (select (select |c_#memory_int| c_ULTIMATE.start_f_~j~0.base) c_ULTIMATE.start_f_~j~0.offset) v_prenex_7)))) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (not (and (= v_prenex_9 c_ULTIMATE.start_f_~j~0.base) (= c_ULTIMATE.start_f_~j~0.offset v_prenex_8))))) is different from true [2020-06-22 10:37:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:21,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:37:21,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:21,461 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:21,462 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 [2020-06-22 10:37:21,466 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:21,519 INFO L497 ElimStorePlain]: treesize reduction 43, result has 53.3 percent of original size [2020-06-22 10:37:21,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-06-22 10:37:21,520 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:38 [2020-06-22 10:37:49,048 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2020-06-22 10:37:49,057 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:37:49,058 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:49,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:49,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:49,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:37:50,521 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (not (and (= ULTIMATE.start_f_~i~0.base c_ULTIMATE.start_f_~j~0.base) (= c_ULTIMATE.start_f_~j~0.offset ULTIMATE.start_f_~i~0.offset)))) is different from true [2020-06-22 10:37:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:50,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:37:50,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:50,574 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:50,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 [2020-06-22 10:37:50,599 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:50,639 INFO L497 ElimStorePlain]: treesize reduction 18, result has 72.3 percent of original size [2020-06-22 10:37:50,644 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-06-22 10:37:50,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:53 [2020-06-22 10:38:07,500 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2020-06-22 10:38:07,501 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:07,516 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:07,516 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:07,517 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2020-06-22 10:38:07,604 INFO L98 LoopCannibalizer]: 27 predicates before loop cannibalization 41 predicates after loop cannibalization [2020-06-22 10:38:07,604 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 41 loop predicates [2020-06-22 10:38:07,604 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 56 transitions. cyclomatic complexity: 22 Second operand 11 states. [2020-06-22 10:40:20,325 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 56 transitions. cyclomatic complexity: 22. Second operand 11 states. Result 318 states and 414 transitions. Complement of second has 128 states. [2020-06-22 10:40:20,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 1 stem states 22 non-accepting loop states 3 accepting loop states [2020-06-22 10:40:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:40:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 118 transitions. [2020-06-22 10:40:20,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 118 transitions. Stem has 18 letters. Loop has 15 letters. [2020-06-22 10:40:20,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:40:20,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 118 transitions. Stem has 33 letters. Loop has 15 letters. [2020-06-22 10:40:20,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:40:20,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 118 transitions. Stem has 18 letters. Loop has 30 letters. [2020-06-22 10:40:20,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:40:20,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 414 transitions. [2020-06-22 10:40:20,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:40:20,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 0 states and 0 transitions. [2020-06-22 10:40:20,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:40:20,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:40:20,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:40:20,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:40:20,341 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:40:20,341 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:40:20,342 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:40:20,342 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:40:20,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:40:20,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:40:20,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:40:20,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:40:20 BasicIcfg [2020-06-22 10:40:20,348 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:40:20,349 INFO L168 Benchmark]: Toolchain (without parser) took 280743.95 ms. Allocated memory was 649.6 MB in the beginning and 996.7 MB in the end (delta: 347.1 MB). Free memory was 565.2 MB in the beginning and 362.8 MB in the end (delta: 202.5 MB). Peak memory consumption was 549.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,351 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:40:20,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.91 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 565.2 MB in the beginning and 643.2 MB in the end (delta: -77.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 679.5 MB. Free memory was 643.2 MB in the beginning and 640.5 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:40:20,352 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 ms. Allocated memory is still 679.5 MB. Free memory was 640.5 MB in the beginning and 639.1 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:40:20,352 INFO L168 Benchmark]: RCFGBuilder took 494.43 ms. Allocated memory is still 679.5 MB. Free memory was 639.1 MB in the beginning and 609.0 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,353 INFO L168 Benchmark]: BlockEncodingV2 took 167.39 ms. Allocated memory is still 679.5 MB. Free memory was 609.0 MB in the beginning and 594.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,353 INFO L168 Benchmark]: TraceAbstraction took 2291.39 ms. Allocated memory was 679.5 MB in the beginning and 748.7 MB in the end (delta: 69.2 MB). Free memory was 594.1 MB in the beginning and 638.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,354 INFO L168 Benchmark]: BuchiAutomizer took 277418.08 ms. Allocated memory was 748.7 MB in the beginning and 996.7 MB in the end (delta: 248.0 MB). Free memory was 638.2 MB in the beginning and 362.8 MB in the end (delta: 275.5 MB). Peak memory consumption was 523.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:40:20,357 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 62 locations, 67 edges - StatisticsResult: Encoded RCFG 53 locations, 135 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.91 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 565.2 MB in the beginning and 643.2 MB in the end (delta: -77.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 679.5 MB. Free memory was 643.2 MB in the beginning and 640.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.25 ms. Allocated memory is still 679.5 MB. Free memory was 640.5 MB in the beginning and 639.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 494.43 ms. Allocated memory is still 679.5 MB. Free memory was 639.1 MB in the beginning and 609.0 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 167.39 ms. Allocated memory is still 679.5 MB. Free memory was 609.0 MB in the beginning and 594.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2291.39 ms. Allocated memory was 679.5 MB in the beginning and 748.7 MB in the end (delta: 69.2 MB). Free memory was 594.1 MB in the beginning and 638.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 277418.08 ms. Allocated memory was 748.7 MB in the beginning and 996.7 MB in the end (delta: 248.0 MB). Free memory was 638.2 MB in the beginning and 362.8 MB in the end (delta: 275.5 MB). Peak memory consumption was 523.4 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: 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 - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: 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 - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant [2020-06-22 10:40:20,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((0 == j && 0 == i) && 1 == \valid[k_ref]) && 0 == k_ref) && 4 == unknown-#length-unknown[l_ref]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == l_ref) && unknown-#length-unknown[j] == 4) && 1 == \valid[j]) && 1 == \valid[l_ref]) && unknown-#length-unknown[k_ref] == 4 - InvariantResult [Line: 6]: Loop Invariant [2020-06-22 10:40:20,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((0 == j && 0 == i) && 1 == \valid[k_ref]) && 0 == k_ref) && 4 == unknown-#length-unknown[l_ref]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == l_ref) && unknown-#length-unknown[j] == 4) && 1 == \valid[j]) && 1 == \valid[l_ref]) && unknown-#length-unknown[k_ref] == 4 - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 10:40:20,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((0 == j && 0 == i) && 1 == \valid[k_ref]) && 0 == k_ref) && 4 == unknown-#length-unknown[l_ref]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == l_ref) && unknown-#length-unknown[j] == 4) && 1 == \valid[j]) && 1 == \valid[l_ref]) && unknown-#length-unknown[k_ref] == 4 - InvariantResult [Line: 22]: Loop Invariant [2020-06-22 10:40:20,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:40:20,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((0 == j && 0 == i) && 1 == \valid[k_ref]) && 0 == k_ref) && 4 == unknown-#length-unknown[l_ref]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == l_ref) && unknown-#length-unknown[j] == 4) && 1 == \valid[j]) && 1 == \valid[l_ref]) && unknown-#length-unknown[k_ref] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 30 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 482 SDslu, 4 SDs, 0 SdLazy, 594 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 212 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 9 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 18 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 27 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 277.3s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 32.5s. Büchi inclusion checks took 231.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 166 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 130 SDtfs, 990 SDslu, 732 SDs, 0 SdLazy, 2824 SolverSat, 386 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 32.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital591 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp33 div108 bol100 ite100 ukn100 eq180 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Forcibly destroying the process !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:40:20.608 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check