./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:21:01,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:21:01,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:21:01,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:21:01,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:21:01,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:21:01,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:21:01,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:21:01,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:21:01,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:21:01,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:21:01,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:21:01,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:21:01,263 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:21:01,264 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:21:01,264 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:21:01,264 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:21:01,265 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:21:01,265 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:21:01,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:21:01,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:21:01,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:21:01,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:21:01,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:21:01,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:21:01,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:21:01,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:21:01,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:21:01,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:21:01,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:21:01,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:21:01,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:21:01,272 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:21:01,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:21:01,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:21:01,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:21:01,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:21:01,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:21:01,274 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:21:01,274 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 [2024-10-15 00:21:01,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:21:01,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:21:01,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:21:01,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:21:01,555 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:21:01,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-10-15 00:21:02,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:21:03,264 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:21:03,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-10-15 00:21:03,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71910ea67/32901393c4ee4f62ad86747feecb0853/FLAG3aaa1c6c2 [2024-10-15 00:21:03,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71910ea67/32901393c4ee4f62ad86747feecb0853 [2024-10-15 00:21:03,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:21:03,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:21:03,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:21:03,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:21:03,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:21:03,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:21:03" (1/1) ... [2024-10-15 00:21:03,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbcf508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:03, skipping insertion in model container [2024-10-15 00:21:03,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:21:03" (1/1) ... [2024-10-15 00:21:03,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:21:03,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:21:03,903 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:21:03,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:21:04,004 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:21:04,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04 WrapperNode [2024-10-15 00:21:04,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:21:04,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:21:04,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:21:04,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:21:04,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,052 INFO L138 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-10-15 00:21:04,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:21:04,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:21:04,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:21:04,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:21:04,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,113 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-15 00:21:04,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:21:04,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:21:04,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:21:04,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:21:04,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (1/1) ... [2024-10-15 00:21:04,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:04,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:04,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:04,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:21:04,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:21:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:21:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:21:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:21:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:21:04,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:21:04,360 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:21:04,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:21:04,476 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-15 00:21:04,476 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:21:04,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:21:04,492 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 00:21:04,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:21:04 BoogieIcfgContainer [2024-10-15 00:21:04,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:21:04,494 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:21:04,494 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:21:04,498 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:21:04,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:21:04,498 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:21:03" (1/3) ... [2024-10-15 00:21:04,499 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@177649f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:21:04, skipping insertion in model container [2024-10-15 00:21:04,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:21:04,499 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:21:04" (2/3) ... [2024-10-15 00:21:04,500 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@177649f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:21:04, skipping insertion in model container [2024-10-15 00:21:04,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:21:04,500 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:21:04" (3/3) ... [2024-10-15 00:21:04,501 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2024-10-15 00:21:04,565 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:21:04,565 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:21:04,565 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:21:04,565 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:21:04,566 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:21:04,566 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:21:04,566 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:21:04,566 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:21:04,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:04,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:21:04,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:04,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:04,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:21:04,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:21:04,593 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:21:04,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:04,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:21:04,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:04,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:04,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:21:04,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:21:04,603 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 18#L516true assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 16#L516-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10#L518true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11#L519-3true [2024-10-15 00:21:04,604 INFO L747 eck$LassoCheckResult]: Loop: 11#L519-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12#L521true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 7#L521-2true call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8#L519-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11#L519-3true [2024-10-15 00:21:04,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-10-15 00:21:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:04,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850774912] [2024-10-15 00:21:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:04,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2024-10-15 00:21:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737320458] [2024-10-15 00:21:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2024-10-15 00:21:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622417632] [2024-10-15 00:21:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:04,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:05,191 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:05,192 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:05,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:05,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:05,192 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:05,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:05,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:05,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2024-10-15 00:21:05,193 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:05,193 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:05,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:05,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:05,769 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:21:05,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:05,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:05,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:05,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:05,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:21:05,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:21:05,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:05,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:05,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:05,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:05,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:21:05,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:21:05,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:05,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:05,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:05,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:05,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:21:05,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:21:05,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:05,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:05,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:05,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:05,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:21:05,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:21:05,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:05,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:05,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:05,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:05,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:05,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:21:05,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:05,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:05,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:05,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:05,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:05,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:05,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:06,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:06,043 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-15 00:21:06,044 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-10-15 00:21:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:06,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:06,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:21:06,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:06,086 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:06,086 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:06,087 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:21:06,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:21:06,153 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-15 00:21:06,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:21:06,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:06,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:21:06,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:06,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:21:06,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:06,297 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:21:06,298 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 48 transitions. Complement of second has 6 states. [2024-10-15 00:21:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2024-10-15 00:21:06,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-15 00:21:06,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:06,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:21:06,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:06,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-15 00:21:06,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:06,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 48 transitions. [2024-10-15 00:21:06,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-10-15 00:21:06,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:06,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:21:06,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-10-15 00:21:06,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:21:06,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-15 00:21:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-10-15 00:21:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:21:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-10-15 00:21:06,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-15 00:21:06,388 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-15 00:21:06,388 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:21:06,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-10-15 00:21:06,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:06,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:06,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:06,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:21:06,390 INFO L745 eck$LassoCheckResult]: Stem: 128#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 123#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 129#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 124#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 125#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 126#L519-4 main_~j~0#1 := 0; 116#L526-3 [2024-10-15 00:21:06,390 INFO L747 eck$LassoCheckResult]: Loop: 116#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 118#L527-3 assume !true; 115#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 116#L526-3 [2024-10-15 00:21:06,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2024-10-15 00:21:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038265561] [2024-10-15 00:21:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038265561] [2024-10-15 00:21:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038265561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:21:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:21:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:21:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151074384] [2024-10-15 00:21:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:21:06,504 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:06,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 72876, now seen corresponding path program 1 times [2024-10-15 00:21:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821311039] [2024-10-15 00:21:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821311039] [2024-10-15 00:21:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821311039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:21:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:21:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:21:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684287326] [2024-10-15 00:21:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:21:06,516 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:21:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:06,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:21:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:21:06,520 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:06,524 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-15 00:21:06,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-10-15 00:21:06,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:21:06,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:06,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:21:06,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-15 00:21:06,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:21:06,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:21:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-15 00:21:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:21:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:21:06,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:21:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:21:06,529 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:21:06,529 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:21:06,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-15 00:21:06,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:06,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:06,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:06,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:21:06,531 INFO L745 eck$LassoCheckResult]: Stem: 165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 160#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 166#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 161#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 162#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 163#L519-4 main_~j~0#1 := 0; 153#L526-3 [2024-10-15 00:21:06,531 INFO L747 eck$LassoCheckResult]: Loop: 153#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 155#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 154#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 152#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153#L526-3 [2024-10-15 00:21:06,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 2 times [2024-10-15 00:21:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303077393] [2024-10-15 00:21:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303077393] [2024-10-15 00:21:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303077393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:21:06,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:21:06,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:21:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104351034] [2024-10-15 00:21:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:21:06,599 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2024-10-15 00:21:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334783180] [2024-10-15 00:21:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:21:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:21:06,668 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:06,695 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-15 00:21:06,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-10-15 00:21:06,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-10-15 00:21:06,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:06,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:21:06,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-10-15 00:21:06,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:21:06,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-15 00:21:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-10-15 00:21:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-10-15 00:21:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:21:06,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:21:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:21:06,702 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:21:06,703 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:21:06,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-15 00:21:06,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:21:06,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:06,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:06,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:06,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:21:06,704 INFO L745 eck$LassoCheckResult]: Stem: 205#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 200#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 206#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 201#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 202#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 203#L521 assume !(main_~val~0#1 < 0); 196#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 197#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 198#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 204#L519-4 main_~j~0#1 := 0; 193#L526-3 [2024-10-15 00:21:06,704 INFO L747 eck$LassoCheckResult]: Loop: 193#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 195#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 194#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 192#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 193#L526-3 [2024-10-15 00:21:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2024-10-15 00:21:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726589066] [2024-10-15 00:21:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:06,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2024-10-15 00:21:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378268794] [2024-10-15 00:21:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2024-10-15 00:21:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:06,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103257352] [2024-10-15 00:21:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:06,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:07,023 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:07,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:07,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:07,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:07,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:07,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:07,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:07,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2024-10-15 00:21:07,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:07,024 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:07,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:07,362 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:07,363 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:07,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:21:07,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:07,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:07,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:07,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:07,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:07,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:07,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:07,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:07,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:07,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:21:07,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:21:07,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:07,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:07,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:07,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:07,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:07,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:07,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:07,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:07,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:07,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:21:07,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:07,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:07,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:07,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:07,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:07,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:07,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:07,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:07,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:07,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:21:07,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:07,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:07,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:07,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:07,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:07,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:07,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:07,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:07,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:07,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:21:07,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:07,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:07,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:07,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:07,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:07,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:07,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:07,563 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:07,585 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-15 00:21:07,585 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-15 00:21:07,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:07,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:07,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:21:07,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:07,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:07,604 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:07,605 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-15 00:21:07,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:21:07,633 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-10-15 00:21:07,636 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:21:07,638 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:21:07,638 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-15 00:21:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:07,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:21:07,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:07,731 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:21:07,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:07,796 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-15 00:21:07,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:07,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 27 transitions. Complement of second has 7 states. [2024-10-15 00:21:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2024-10-15 00:21:07,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-15 00:21:07,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:07,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-15 00:21:07,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:07,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2024-10-15 00:21:07,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:07,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-10-15 00:21:07,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:07,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-10-15 00:21:07,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:07,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-15 00:21:07,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-10-15 00:21:07,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:07,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-15 00:21:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-10-15 00:21:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-15 00:21:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-15 00:21:07,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-15 00:21:07,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-15 00:21:07,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:21:07,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-10-15 00:21:07,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:07,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:07,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:07,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:07,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:07,872 INFO L745 eck$LassoCheckResult]: Stem: 330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 325#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 331#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 326#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 327#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 328#L521 assume !(main_~val~0#1 < 0); 321#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 322#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 323#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 329#L519-4 main_~j~0#1 := 0; 320#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 317#L527-3 [2024-10-15 00:21:07,872 INFO L747 eck$LassoCheckResult]: Loop: 317#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 316#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 317#L527-3 [2024-10-15 00:21:07,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2024-10-15 00:21:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911194358] [2024-10-15 00:21:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2024-10-15 00:21:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487889018] [2024-10-15 00:21:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2024-10-15 00:21:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997439903] [2024-10-15 00:21:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:07,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:08,173 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:08,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:08,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:08,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:08,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:08,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:08,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:08,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:08,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration5_Lasso [2024-10-15 00:21:08,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:08,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:08,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:08,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:08,538 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:08,541 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:08,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:21:08,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:08,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:08,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:08,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:08,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:08,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:08,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:08,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:08,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:21:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:08,587 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:08,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:21:08,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:08,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:08,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:08,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:08,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:08,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:08,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:08,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:08,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 00:21:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:08,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:08,631 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:08,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:21:08,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:08,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:08,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:08,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:08,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:08,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:08,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:08,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:08,675 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-15 00:21:08,676 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:08,678 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:08,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:21:08,680 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:08,697 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:08,698 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:08,698 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2 Supporting invariants [] [2024-10-15 00:21:08,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:08,719 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-10-15 00:21:08,721 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:08,721 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:08,721 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:08,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:21:08,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:08,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:08,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:08,868 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-15 00:21:08,868 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:08,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-10-15 00:21:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-15 00:21:08,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-15 00:21:08,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:08,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-15 00:21:08,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:08,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-15 00:21:08,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:08,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-15 00:21:08,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:08,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2024-10-15 00:21:08,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:08,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:08,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-15 00:21:08,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:08,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-15 00:21:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-15 00:21:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-15 00:21:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-15 00:21:08,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-15 00:21:08,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-15 00:21:08,928 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:21:08,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-10-15 00:21:08,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:08,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:08,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:08,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:08,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:08,930 INFO L745 eck$LassoCheckResult]: Stem: 469#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 463#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 470#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 464#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 465#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 466#L521 assume !(main_~val~0#1 < 0); 459#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 460#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 461#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 467#L519-4 main_~j~0#1 := 0; 457#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 456#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 471#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 451#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 452#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 454#L527-3 [2024-10-15 00:21:08,931 INFO L747 eck$LassoCheckResult]: Loop: 454#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 453#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 454#L527-3 [2024-10-15 00:21:08,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2024-10-15 00:21:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833313435] [2024-10-15 00:21:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:09,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833313435] [2024-10-15 00:21:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833313435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308912224] [2024-10-15 00:21:09,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:21:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:09,026 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:09,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-15 00:21:09,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:21:09,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:09,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:21:09,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:09,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:09,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308912224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:09,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-15 00:21:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252409234] [2024-10-15 00:21:09,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:09,174 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:09,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2024-10-15 00:21:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474642531] [2024-10-15 00:21:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:09,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-15 00:21:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:09,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 00:21:09,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-15 00:21:09,273 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:09,352 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-10-15 00:21:09,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-10-15 00:21:09,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:09,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 28 states and 35 transitions. [2024-10-15 00:21:09,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:09,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:09,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-10-15 00:21:09,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:09,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-15 00:21:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-10-15 00:21:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-15 00:21:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-15 00:21:09,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-15 00:21:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:21:09,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-15 00:21:09,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:21:09,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-10-15 00:21:09,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:09,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:09,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:09,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:09,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:09,363 INFO L745 eck$LassoCheckResult]: Stem: 646#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 640#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 647#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 641#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 642#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 643#L521 assume !(main_~val~0#1 < 0); 651#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 637#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 638#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 644#L521 assume !(main_~val~0#1 < 0); 635#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 636#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 650#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 648#L519-4 main_~j~0#1 := 0; 633#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 632#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 649#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 627#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 628#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 630#L527-3 [2024-10-15 00:21:09,364 INFO L747 eck$LassoCheckResult]: Loop: 630#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 629#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 630#L527-3 [2024-10-15 00:21:09,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2024-10-15 00:21:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:09,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912017303] [2024-10-15 00:21:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2024-10-15 00:21:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197512844] [2024-10-15 00:21:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:09,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2024-10-15 00:21:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931234689] [2024-10-15 00:21:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:09,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:09,719 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:09,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:09,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:09,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:09,720 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:09,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:09,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:09,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:09,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration7_Lasso [2024-10-15 00:21:09,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:09,720 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:09,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:09,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:10,053 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:10,054 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:10,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:10,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:10,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:21:10,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:10,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:10,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:10,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:10,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:10,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:10,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:10,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:10,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:21:10,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:10,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:10,086 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:21:10,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:10,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:10,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:10,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:10,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:10,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:10,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:10,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:10,123 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:21:10,123 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:10,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:10,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:10,125 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:21:10,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:10,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:10,142 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:10,142 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-10-15 00:21:10,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:10,170 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:21:10,172 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:10,173 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:10,173 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:10,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:10,346 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:10,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-10-15 00:21:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:10,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:21:10,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:10,376 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:10,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:10,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-10-15 00:21:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:10,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:21:10,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:10,592 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:10,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:10,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:10,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:10,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:10,790 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:10,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,868 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 50 transitions. Complement of second has 11 states. [2024-10-15 00:21:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2024-10-15 00:21:10,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:21:10,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:10,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-15 00:21:10,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:10,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-15 00:21:10,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:10,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2024-10-15 00:21:10,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:10,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 43 transitions. [2024-10-15 00:21:10,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:10,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:10,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2024-10-15 00:21:10,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:10,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-10-15 00:21:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2024-10-15 00:21:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-10-15 00:21:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-15 00:21:10,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-15 00:21:10,877 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-15 00:21:10,877 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:21:10,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2024-10-15 00:21:10,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:10,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:10,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:10,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:10,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:10,879 INFO L745 eck$LassoCheckResult]: Stem: 1049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1041#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1042#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1050#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1043#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1044#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1045#L521 assume !(main_~val~0#1 < 0); 1038#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1039#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1040#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1046#L521 assume !(main_~val~0#1 < 0); 1054#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1053#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1052#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1051#L519-4 main_~j~0#1 := 0; 1035#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1036#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1056#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1055#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1037#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1034#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1058#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1029#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1030#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1032#L527-3 [2024-10-15 00:21:10,879 INFO L747 eck$LassoCheckResult]: Loop: 1032#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1031#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1032#L527-3 [2024-10-15 00:21:10,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1808436561, now seen corresponding path program 4 times [2024-10-15 00:21:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:10,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088326416] [2024-10-15 00:21:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088326416] [2024-10-15 00:21:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088326416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263079134] [2024-10-15 00:21:11,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:21:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:11,021 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:11,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-15 00:21:11,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:21:11,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:11,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:21:11,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:11,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263079134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:11,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-15 00:21:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273848811] [2024-10-15 00:21:11,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:11,223 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2024-10-15 00:21:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737429347] [2024-10-15 00:21:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 00:21:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-15 00:21:11,271 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:11,349 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-15 00:21:11,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2024-10-15 00:21:11,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:11,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2024-10-15 00:21:11,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:11,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:11,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-10-15 00:21:11,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:11,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-15 00:21:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-10-15 00:21:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-15 00:21:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-10-15 00:21:11,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-15 00:21:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:21:11,354 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-15 00:21:11,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:21:11,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-10-15 00:21:11,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:11,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:11,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:11,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:11,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:11,357 INFO L745 eck$LassoCheckResult]: Stem: 1283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1275#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1284#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1276#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1277#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1278#L521 assume !(main_~val~0#1 < 0); 1296#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1295#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1279#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1280#L521 assume !(main_~val~0#1 < 0); 1271#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1272#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1273#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1287#L521 assume !(main_~val~0#1 < 0); 1294#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1288#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1286#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1285#L519-4 main_~j~0#1 := 0; 1269#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1270#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1291#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1263#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1264#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1268#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1292#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1290#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1289#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1266#L527-3 [2024-10-15 00:21:11,357 INFO L747 eck$LassoCheckResult]: Loop: 1266#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1265#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1266#L527-3 [2024-10-15 00:21:11,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -759828824, now seen corresponding path program 5 times [2024-10-15 00:21:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412575920] [2024-10-15 00:21:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:11,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2024-10-15 00:21:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826110817] [2024-10-15 00:21:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash -51058003, now seen corresponding path program 2 times [2024-10-15 00:21:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234504618] [2024-10-15 00:21:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:11,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:11,894 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:11,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:11,894 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:11,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:11,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:11,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:11,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:11,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:11,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration9_Lasso [2024-10-15 00:21:11,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:11,895 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:11,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:11,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:12,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:12,307 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:12,308 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,310 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:21:12,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,337 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:21:12,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:21:12,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,389 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:21:12,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,414 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:21:12,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,445 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:21:12,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,478 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-15 00:21:12,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,509 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:21:12,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,542 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:21:12,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,568 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:21:12,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,593 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-15 00:21:12,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,619 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-15 00:21:12,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-15 00:21:12,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,645 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:21:12,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:12,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:12,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:12,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-15 00:21:12,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,672 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-15 00:21:12,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,701 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:21:12,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-15 00:21:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,736 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:21:12,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,767 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:21:12,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:12,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-15 00:21:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,803 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:21:12,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:12,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:12,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:12,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:12,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:12,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:12,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:12,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:12,833 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-15 00:21:12,833 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:12,834 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:12,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:21:12,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:12,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:12,847 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:12,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-10-15 00:21:12,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:21:12,867 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-10-15 00:21:12,869 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:12,869 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:12,869 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:12,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:12,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:21:12,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:12,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:12,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:12,986 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:12,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,001 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-10-15 00:21:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:13,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-15 00:21:13,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:13,004 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:13,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:21:13,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:13,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:13,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:13,153 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:13,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-10-15 00:21:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:13,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-15 00:21:13,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:13,176 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:13,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:21:13,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:13,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:13,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:13,308 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-15 00:21:13,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 63 transitions. Complement of second has 12 states. [2024-10-15 00:21:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-10-15 00:21:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-15 00:21:13,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 30 letters. Loop has 2 letters. [2024-10-15 00:21:13,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:13,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-15 00:21:13,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:13,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 63 transitions. [2024-10-15 00:21:13,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:13,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 56 transitions. [2024-10-15 00:21:13,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:13,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:13,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-10-15 00:21:13,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:13,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-15 00:21:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-10-15 00:21:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-10-15 00:21:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-15 00:21:13,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-15 00:21:13,390 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-15 00:21:13,390 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:21:13,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2024-10-15 00:21:13,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:13,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:13,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:13,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:13,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:13,391 INFO L745 eck$LassoCheckResult]: Stem: 1792#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1786#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1793#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1787#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1788#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1789#L521 assume !(main_~val~0#1 < 0); 1803#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1783#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1784#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1790#L521 assume !(main_~val~0#1 < 0); 1781#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1782#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1799#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1796#L521 assume !(main_~val~0#1 < 0); 1798#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1797#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1795#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1794#L519-4 main_~j~0#1 := 0; 1778#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1779#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1805#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1806#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1780#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1777#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1791#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1772#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1773#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1808#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1804#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1802#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1800#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1775#L527-3 [2024-10-15 00:21:13,392 INFO L747 eck$LassoCheckResult]: Loop: 1775#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1774#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1775#L527-3 [2024-10-15 00:21:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1822100739, now seen corresponding path program 6 times [2024-10-15 00:21:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354889013] [2024-10-15 00:21:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354889013] [2024-10-15 00:21:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354889013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84522754] [2024-10-15 00:21:13,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:21:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:13,539 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:13,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-10-15 00:21:13,603 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-10-15 00:21:13,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:13,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:13,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:13,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84522754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:13,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-15 00:21:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291097723] [2024-10-15 00:21:13,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:13,806 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 6 times [2024-10-15 00:21:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835077703] [2024-10-15 00:21:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:13,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:13,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:13,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 00:21:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-15 00:21:13,891 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 15 Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:13,994 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-10-15 00:21:13,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-10-15 00:21:13,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:13,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 57 transitions. [2024-10-15 00:21:13,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:13,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:14,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2024-10-15 00:21:14,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:14,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-15 00:21:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2024-10-15 00:21:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-15 00:21:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-10-15 00:21:14,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-15 00:21:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:21:14,006 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-15 00:21:14,006 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:21:14,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-10-15 00:21:14,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:14,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:14,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:14,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:14,008 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:14,008 INFO L745 eck$LassoCheckResult]: Stem: 2100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2093#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2101#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2094#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2095#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2096#L521 assume !(main_~val~0#1 < 0); 2122#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2121#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2097#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2098#L521 assume !(main_~val~0#1 < 0); 2089#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2090#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2091#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2120#L521 assume !(main_~val~0#1 < 0); 2119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2118#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2117#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2104#L521 assume !(main_~val~0#1 < 0); 2116#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2105#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2103#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 2102#L519-4 main_~j~0#1 := 0; 2086#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2087#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2110#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2111#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2088#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2085#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2099#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2080#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2081#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2114#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2109#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2108#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2106#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2083#L527-3 [2024-10-15 00:21:14,008 INFO L747 eck$LassoCheckResult]: Loop: 2083#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2082#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2083#L527-3 [2024-10-15 00:21:14,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1774872054, now seen corresponding path program 7 times [2024-10-15 00:21:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506008258] [2024-10-15 00:21:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:14,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 7 times [2024-10-15 00:21:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398788041] [2024-10-15 00:21:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:14,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 550028923, now seen corresponding path program 3 times [2024-10-15 00:21:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744556334] [2024-10-15 00:21:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:14,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:14,701 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:14,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:14,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:14,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:14,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:14,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:14,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:14,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:14,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration11_Lasso [2024-10-15 00:21:14,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:14,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:14,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:14,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:15,112 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:15,112 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:15,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,118 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:21:15,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:21:15,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,145 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:21:15,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-15 00:21:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,170 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:21:15,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-15 00:21:15,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,196 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:21:15,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-15 00:21:15,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,222 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:21:15,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:21:15,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,251 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:21:15,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-15 00:21:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,275 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:21:15,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:15,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,303 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:21:15,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-15 00:21:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,328 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-15 00:21:15,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-15 00:21:15,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,355 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-15 00:21:15,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-15 00:21:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,381 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-15 00:21:15,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:15,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,408 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-15 00:21:15,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-15 00:21:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,434 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-15 00:21:15,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:15,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:15,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:15,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,459 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-15 00:21:15,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:21:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,487 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-15 00:21:15,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-15 00:21:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,524 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-15 00:21:15,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,556 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-15 00:21:15,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:15,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-15 00:21:15,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,601 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-15 00:21:15,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:15,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:15,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:15,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:15,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:15,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:15,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:15,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:15,650 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-15 00:21:15,650 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:21:15,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:15,653 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:15,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-15 00:21:15,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:15,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:15,665 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:15,665 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-10-15 00:21:15,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-15 00:21:15,692 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-10-15 00:21:15,694 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:15,695 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:15,695 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:15,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:15,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:15,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:15,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:15,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-15 00:21:15,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:15,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-10-15 00:21:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:15,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-15 00:21:15,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:15,877 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:15,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:15,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:16,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:16,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:16,027 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-15 00:21:16,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,048 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-10-15 00:21:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-15 00:21:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:16,049 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:16,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:16,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:21:16,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:16,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:16,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:16,199 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-15 00:21:16,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 76 transitions. Complement of second has 14 states. [2024-10-15 00:21:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-10-15 00:21:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-15 00:21:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2024-10-15 00:21:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:16,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 4 letters. [2024-10-15 00:21:16,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:16,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2024-10-15 00:21:16,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:16,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2024-10-15 00:21:16,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:16,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:16,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2024-10-15 00:21:16,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:16,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-15 00:21:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2024-10-15 00:21:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-10-15 00:21:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-15 00:21:16,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-15 00:21:16,285 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-15 00:21:16,286 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:21:16,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2024-10-15 00:21:16,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:16,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:16,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:16,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:16,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:16,287 INFO L745 eck$LassoCheckResult]: Stem: 2728#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2721#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2729#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2722#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2723#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2724#L521 assume !(main_~val~0#1 < 0); 2716#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2717#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2725#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2726#L521 assume !(main_~val~0#1 < 0); 2742#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2718#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2719#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2738#L521 assume !(main_~val~0#1 < 0); 2737#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2736#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2735#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2732#L521 assume !(main_~val~0#1 < 0); 2734#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2733#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2731#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 2730#L519-4 main_~j~0#1 := 0; 2714#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2713#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2727#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2708#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2709#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2715#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2754#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2753#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2752#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2750#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2749#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2748#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2747#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2746#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2743#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2741#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2739#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2711#L527-3 [2024-10-15 00:21:16,287 INFO L747 eck$LassoCheckResult]: Loop: 2711#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2710#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2711#L527-3 [2024-10-15 00:21:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 296817483, now seen corresponding path program 8 times [2024-10-15 00:21:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62326356] [2024-10-15 00:21:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62326356] [2024-10-15 00:21:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62326356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260819344] [2024-10-15 00:21:16,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:21:16,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:16,462 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-10-15 00:21:16,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:21:16,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:16,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:21:16,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:16,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:16,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260819344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:16,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-10-15 00:21:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366821985] [2024-10-15 00:21:16,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:16,784 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 8 times [2024-10-15 00:21:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994576595] [2024-10-15 00:21:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:16,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:16,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 00:21:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-15 00:21:16,824 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. cyclomatic complexity: 18 Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:16,937 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-10-15 00:21:16,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 94 transitions. [2024-10-15 00:21:16,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:16,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 55 states and 68 transitions. [2024-10-15 00:21:16,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:16,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:16,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2024-10-15 00:21:16,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:16,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-10-15 00:21:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2024-10-15 00:21:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-15 00:21:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-10-15 00:21:16,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-10-15 00:21:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 00:21:16,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-10-15 00:21:16,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:21:16,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 64 transitions. [2024-10-15 00:21:16,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:16,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:16,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:16,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:16,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:16,947 INFO L745 eck$LassoCheckResult]: Stem: 3109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3102#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3110#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3103#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3104#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3105#L521 assume !(main_~val~0#1 < 0); 3141#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3140#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3106#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3107#L521 assume !(main_~val~0#1 < 0); 3098#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3099#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3100#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3139#L521 assume !(main_~val~0#1 < 0); 3138#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3137#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3136#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3135#L521 assume !(main_~val~0#1 < 0); 3134#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3132#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3130#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3113#L521 assume !(main_~val~0#1 < 0); 3119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3114#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3112#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 3111#L519-4 main_~j~0#1 := 0; 3095#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3096#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3094#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3090#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3091#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3097#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3131#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3129#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3128#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3126#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3125#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3124#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3123#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3122#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3118#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3117#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3115#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3093#L527-3 [2024-10-15 00:21:16,947 INFO L747 eck$LassoCheckResult]: Loop: 3093#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3092#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3093#L527-3 [2024-10-15 00:21:16,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1662287172, now seen corresponding path program 9 times [2024-10-15 00:21:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:16,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329624434] [2024-10-15 00:21:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:16,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:17,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 9 times [2024-10-15 00:21:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364342726] [2024-10-15 00:21:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:17,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:17,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:17,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -269860279, now seen corresponding path program 4 times [2024-10-15 00:21:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283811365] [2024-10-15 00:21:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:17,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:17,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:17,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-15 00:21:17,925 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:17,925 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:17,925 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:17,925 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:17,925 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:17,925 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:17,925 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:17,925 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:17,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration13_Lasso [2024-10-15 00:21:17,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:17,925 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:17,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:17,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:18,368 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:18,368 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:18,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,371 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-15 00:21:18,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,397 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-15 00:21:18,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-15 00:21:18,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,422 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-15 00:21:18,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-15 00:21:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,447 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-15 00:21:18,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:18,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,478 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-15 00:21:18,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-15 00:21:18,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,506 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-15 00:21:18,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-15 00:21:18,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,531 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-15 00:21:18,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-15 00:21:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,556 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-15 00:21:18,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-15 00:21:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,581 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-15 00:21:18,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:18,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:18,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:18,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-15 00:21:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,606 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-15 00:21:18,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:18,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,638 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-15 00:21:18,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-15 00:21:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,669 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-15 00:21:18,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:18,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-15 00:21:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,703 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-15 00:21:18,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:18,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:18,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:18,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:18,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:18,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:18,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:18,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:18,741 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:21:18,741 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:21:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:18,744 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:18,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-15 00:21:18,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:18,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:18,759 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:18,759 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-10-15 00:21:18,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-15 00:21:18,783 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-10-15 00:21:18,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:18,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:18,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:18,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:21:18,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:18,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:18,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:18,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:18,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-15 00:21:18,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:18,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-10-15 00:21:18,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:18,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-15 00:21:18,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:18,989 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:19,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:21:19,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:19,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:19,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:19,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-15 00:21:19,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:19,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-10-15 00:21:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:19,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-15 00:21:19,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:19,190 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:19,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:21:19,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:19,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:19,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:19,339 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-15 00:21:19,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:19,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 89 transitions. Complement of second has 16 states. [2024-10-15 00:21:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2024-10-15 00:21:19,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-15 00:21:19,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:19,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 46 letters. Loop has 2 letters. [2024-10-15 00:21:19,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:19,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 4 letters. [2024-10-15 00:21:19,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:19,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2024-10-15 00:21:19,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:19,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 65 states and 82 transitions. [2024-10-15 00:21:19,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:19,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:19,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 82 transitions. [2024-10-15 00:21:19,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:19,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-10-15 00:21:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 82 transitions. [2024-10-15 00:21:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-10-15 00:21:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-10-15 00:21:19,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-10-15 00:21:19,458 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-10-15 00:21:19,459 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:21:19,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 70 transitions. [2024-10-15 00:21:19,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:19,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:19,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:19,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:19,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:19,464 INFO L745 eck$LassoCheckResult]: Stem: 3858#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3851#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3859#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3852#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3853#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3854#L521 assume !(main_~val~0#1 < 0); 3846#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3847#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3855#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3856#L521 assume !(main_~val~0#1 < 0); 3876#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3848#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3849#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3872#L521 assume !(main_~val~0#1 < 0); 3871#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3870#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3869#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3868#L521 assume !(main_~val~0#1 < 0); 3867#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3866#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3865#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3862#L521 assume !(main_~val~0#1 < 0); 3864#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3863#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3861#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 3860#L519-4 main_~j~0#1 := 0; 3843#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3844#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3892#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3891#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3845#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3842#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3857#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3837#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3838#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3889#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3888#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3887#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3886#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3884#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3883#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3882#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3881#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3880#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3877#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3875#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3873#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3840#L527-3 [2024-10-15 00:21:19,464 INFO L747 eck$LassoCheckResult]: Loop: 3840#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3839#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3840#L527-3 [2024-10-15 00:21:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1637690471, now seen corresponding path program 10 times [2024-10-15 00:21:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761260521] [2024-10-15 00:21:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761260521] [2024-10-15 00:21:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761260521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27034830] [2024-10-15 00:21:19,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:21:19,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:19,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:19,710 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:19,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-10-15 00:21:19,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:21:19,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:19,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 00:21:19,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:19,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27034830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:20,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-10-15 00:21:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143227304] [2024-10-15 00:21:20,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:20,084 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:20,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 10 times [2024-10-15 00:21:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:20,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620706] [2024-10-15 00:21:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 00:21:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-10-15 00:21:20,131 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. cyclomatic complexity: 21 Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:20,284 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-10-15 00:21:20,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 111 transitions. [2024-10-15 00:21:20,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:20,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 64 states and 79 transitions. [2024-10-15 00:21:20,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:20,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:20,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2024-10-15 00:21:20,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:20,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-10-15 00:21:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2024-10-15 00:21:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-15 00:21:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-10-15 00:21:20,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-15 00:21:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 00:21:20,293 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-15 00:21:20,293 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-15 00:21:20,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-10-15 00:21:20,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:20,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:20,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:20,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:20,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:20,294 INFO L745 eck$LassoCheckResult]: Stem: 4312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 4306#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 4313#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 4307#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4308#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4309#L521 assume !(main_~val~0#1 < 0); 4302#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4303#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4304#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4310#L521 assume !(main_~val~0#1 < 0); 4353#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4352#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4351#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4350#L521 assume !(main_~val~0#1 < 0); 4349#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4348#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4347#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4346#L521 assume !(main_~val~0#1 < 0); 4345#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4344#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4343#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4342#L521 assume !(main_~val~0#1 < 0); 4341#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4340#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4339#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4316#L521 assume !(main_~val~0#1 < 0); 4322#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4317#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4315#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 4314#L519-4 main_~j~0#1 := 0; 4299#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4300#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4337#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4336#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4301#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4298#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4311#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4293#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4294#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4334#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4333#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4332#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4331#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4329#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4328#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4327#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4326#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4325#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4321#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4320#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4318#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4296#L527-3 [2024-10-15 00:21:20,294 INFO L747 eck$LassoCheckResult]: Loop: 4296#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4295#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4296#L527-3 [2024-10-15 00:21:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 618476690, now seen corresponding path program 11 times [2024-10-15 00:21:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454699690] [2024-10-15 00:21:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:20,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 11 times [2024-10-15 00:21:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140604529] [2024-10-15 00:21:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:20,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1650613783, now seen corresponding path program 5 times [2024-10-15 00:21:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117901577] [2024-10-15 00:21:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:20,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:21,842 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:21,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:21,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:21,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:21,843 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:21,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:21,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:21,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:21,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration15_Lasso [2024-10-15 00:21:21,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:21,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:21,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:21,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:22,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:22,590 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:22,590 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:22,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,592 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-15 00:21:22,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-10-15 00:21:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,617 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-15 00:21:22,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-15 00:21:22,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,643 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-15 00:21:22,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-15 00:21:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,669 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-15 00:21:22,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-15 00:21:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,694 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-15 00:21:22,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:22,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:22,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-15 00:21:22,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,721 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-15 00:21:22,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-15 00:21:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,746 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-15 00:21:22,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-15 00:21:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,771 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-15 00:21:22,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-15 00:21:22,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,796 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-15 00:21:22,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,821 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-15 00:21:22,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:22,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:22,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-15 00:21:22,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,849 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-15 00:21:22,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-15 00:21:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,874 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-15 00:21:22,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,900 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-15 00:21:22,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:22,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:22,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:22,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-15 00:21:22,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,927 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-15 00:21:22,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:22,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:22,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-15 00:21:22,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,957 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-15 00:21:22,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:22,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:22,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:22,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:22,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:22,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:22,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:22,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:22,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:22,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:22,989 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:22,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-15 00:21:22,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-15 00:21:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,020 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-15 00:21:23,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-15 00:21:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,049 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-15 00:21:23,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-15 00:21:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,079 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-15 00:21:23,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-15 00:21:23,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,107 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-15 00:21:23,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-15 00:21:23,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,137 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-15 00:21:23,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:23,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-15 00:21:23,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,166 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-15 00:21:23,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:23,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:23,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:23,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:23,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:23,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:23,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:23,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:23,193 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:21:23,193 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:23,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:23,194 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:23,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-15 00:21:23,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:23,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:23,208 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:23,208 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1 Supporting invariants [] [2024-10-15 00:21:23,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-15 00:21:23,269 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2024-10-15 00:21:23,271 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:23,271 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:23,272 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:23,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 00:21:23,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:23,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:23,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:23,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:23,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:23,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-10-15 00:21:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:23,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-15 00:21:23,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:23,593 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:23,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:23,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 00:21:23,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:23,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:23,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:23,870 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:23,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:23,902 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-10-15 00:21:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:23,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-15 00:21:23,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:23,903 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:23,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 00:21:23,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:24,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:24,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:24,159 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:24,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:24,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:24,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 102 transitions. Complement of second has 19 states. [2024-10-15 00:21:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2024-10-15 00:21:24,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-15 00:21:24,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:24,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 54 letters. Loop has 2 letters. [2024-10-15 00:21:24,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:24,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 4 letters. [2024-10-15 00:21:24,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:24,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2024-10-15 00:21:24,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:24,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 75 states and 95 transitions. [2024-10-15 00:21:24,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:24,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:24,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 95 transitions. [2024-10-15 00:21:24,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:24,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-10-15 00:21:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 95 transitions. [2024-10-15 00:21:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2024-10-15 00:21:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-10-15 00:21:24,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-15 00:21:24,343 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-15 00:21:24,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-15 00:21:24,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 81 transitions. [2024-10-15 00:21:24,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:24,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:24,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:24,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:24,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:24,345 INFO L745 eck$LassoCheckResult]: Stem: 5252#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5245#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 5253#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5246#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5247#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5248#L521 assume !(main_~val~0#1 < 0); 5240#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5241#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5250#L521 assume !(main_~val~0#1 < 0); 5274#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5243#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5270#L521 assume !(main_~val~0#1 < 0); 5269#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5268#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5267#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5266#L521 assume !(main_~val~0#1 < 0); 5265#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5264#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5263#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5262#L521 assume !(main_~val~0#1 < 0); 5261#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5260#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5259#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5256#L521 assume !(main_~val~0#1 < 0); 5258#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5257#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5255#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 5254#L519-4 main_~j~0#1 := 0; 5237#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5238#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5295#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5294#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5239#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5236#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5251#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5231#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5232#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5292#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5291#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5290#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5289#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5287#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5286#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5285#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5284#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5282#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5281#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5280#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5279#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5278#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5275#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5273#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5271#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5234#L527-3 [2024-10-15 00:21:24,349 INFO L747 eck$LassoCheckResult]: Loop: 5234#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5233#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5234#L527-3 [2024-10-15 00:21:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1396913127, now seen corresponding path program 12 times [2024-10-15 00:21:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682158358] [2024-10-15 00:21:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682158358] [2024-10-15 00:21:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682158358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610371991] [2024-10-15 00:21:24,606 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:21:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:24,608 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:24,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2024-10-15 00:21:24,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-15 00:21:24,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:24,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:21:24,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:24,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610371991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:25,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-10-15 00:21:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822001330] [2024-10-15 00:21:25,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:25,060 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:25,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 12 times [2024-10-15 00:21:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197282327] [2024-10-15 00:21:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 00:21:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-10-15 00:21:25,102 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. cyclomatic complexity: 24 Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:25,255 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2024-10-15 00:21:25,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 128 transitions. [2024-10-15 00:21:25,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:25,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 73 states and 90 transitions. [2024-10-15 00:21:25,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:25,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:25,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 90 transitions. [2024-10-15 00:21:25,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:25,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-10-15 00:21:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 90 transitions. [2024-10-15 00:21:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-15 00:21:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-10-15 00:21:25,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-10-15 00:21:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 00:21:25,265 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-10-15 00:21:25,266 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-15 00:21:25,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2024-10-15 00:21:25,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:25,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:25,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:25,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:25,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:25,267 INFO L745 eck$LassoCheckResult]: Stem: 5780#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5774#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 5781#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5775#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5776#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5777#L521 assume !(main_~val~0#1 < 0); 5770#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5771#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5772#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5778#L521 assume !(main_~val~0#1 < 0); 5830#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5829#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5828#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5827#L521 assume !(main_~val~0#1 < 0); 5826#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5825#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5824#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5823#L521 assume !(main_~val~0#1 < 0); 5822#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5821#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5820#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5819#L521 assume !(main_~val~0#1 < 0); 5818#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5817#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5816#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5815#L521 assume !(main_~val~0#1 < 0); 5814#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5813#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5812#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5784#L521 assume !(main_~val~0#1 < 0); 5790#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5785#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5783#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 5782#L519-4 main_~j~0#1 := 0; 5767#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5768#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5810#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5809#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5769#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5766#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5779#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5761#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5762#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5807#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5806#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5805#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5804#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5802#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5801#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5800#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5799#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5797#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5796#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5795#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5794#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5793#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5789#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5788#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5786#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5764#L527-3 [2024-10-15 00:21:25,268 INFO L747 eck$LassoCheckResult]: Loop: 5764#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5763#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5764#L527-3 [2024-10-15 00:21:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1611822112, now seen corresponding path program 13 times [2024-10-15 00:21:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648083902] [2024-10-15 00:21:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 13 times [2024-10-15 00:21:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467365567] [2024-10-15 00:21:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1522145765, now seen corresponding path program 6 times [2024-10-15 00:21:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728264485] [2024-10-15 00:21:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:25,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:28,292 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:28,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:28,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:28,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:28,293 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:28,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:28,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:28,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:28,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration17_Lasso [2024-10-15 00:21:28,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:28,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:28,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:28,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:29,662 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:29,662 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:29,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,663 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-10-15 00:21:29,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:29,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:29,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:29,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-10-15 00:21:29,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,694 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-15 00:21:29,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-10-15 00:21:29,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,724 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-15 00:21:29,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-15 00:21:29,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,753 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-15 00:21:29,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-15 00:21:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,781 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-15 00:21:29,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,809 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-15 00:21:29,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-15 00:21:29,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,835 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-15 00:21:29,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:29,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,862 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-15 00:21:29,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:29,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-15 00:21:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,890 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-15 00:21:29,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:29,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:29,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:29,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:29,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:29,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:29,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:29,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:29,918 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-15 00:21:29,918 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-15 00:21:29,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:29,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:29,920 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:29,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-15 00:21:29,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:29,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:29,932 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:29,932 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2024-10-15 00:21:29,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-15 00:21:29,986 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-10-15 00:21:29,988 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:29,988 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:29,988 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:30,195 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:30,195 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-10-15 00:21:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:30,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-15 00:21:30,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:30,220 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:30,422 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:30,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-10-15 00:21:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:30,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-15 00:21:30,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:30,440 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:30,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:30,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:30,641 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-15 00:21:30,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 115 transitions. Complement of second has 20 states. [2024-10-15 00:21:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2024-10-15 00:21:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-15 00:21:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 62 letters. Loop has 2 letters. [2024-10-15 00:21:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 4 letters. [2024-10-15 00:21:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:30,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2024-10-15 00:21:30,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:30,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 108 transitions. [2024-10-15 00:21:30,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:30,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:30,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 108 transitions. [2024-10-15 00:21:30,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:30,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-10-15 00:21:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 108 transitions. [2024-10-15 00:21:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-10-15 00:21:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-10-15 00:21:30,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-10-15 00:21:30,771 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-10-15 00:21:30,771 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-15 00:21:30,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 92 transitions. [2024-10-15 00:21:30,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:30,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:30,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:30,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:30,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:30,773 INFO L745 eck$LassoCheckResult]: Stem: 6791#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6784#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 6792#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6785#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6786#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6787#L521 assume !(main_~val~0#1 < 0); 6779#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6780#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6788#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6789#L521 assume !(main_~val~0#1 < 0); 6817#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6781#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6782#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6813#L521 assume !(main_~val~0#1 < 0); 6812#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6811#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6810#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6809#L521 assume !(main_~val~0#1 < 0); 6808#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6807#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6806#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6805#L521 assume !(main_~val~0#1 < 0); 6804#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6803#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6802#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6801#L521 assume !(main_~val~0#1 < 0); 6800#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6799#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6798#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6795#L521 assume !(main_~val~0#1 < 0); 6797#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6796#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6794#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 6793#L519-4 main_~j~0#1 := 0; 6776#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6777#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6843#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6842#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6778#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6775#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6790#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6770#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6771#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6840#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6839#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6838#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6837#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6835#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6834#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6833#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6832#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6830#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6829#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6828#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6827#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6825#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6824#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6823#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6822#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6821#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6818#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6816#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6814#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6773#L527-3 [2024-10-15 00:21:30,773 INFO L747 eck$LassoCheckResult]: Loop: 6773#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6772#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6773#L527-3 [2024-10-15 00:21:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1801767883, now seen corresponding path program 14 times [2024-10-15 00:21:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005503002] [2024-10-15 00:21:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:31,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-10-15 00:21:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005503002] [2024-10-15 00:21:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005503002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505743982] [2024-10-15 00:21:31,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:21:31,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:31,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:31,136 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:31,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2024-10-15 00:21:31,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:21:31,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:31,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 00:21:31,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:31,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505743982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:31,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-10-15 00:21:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954163072] [2024-10-15 00:21:31,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:31,725 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 14 times [2024-10-15 00:21:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169319669] [2024-10-15 00:21:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 00:21:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2024-10-15 00:21:31,770 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:31,900 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-10-15 00:21:31,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 145 transitions. [2024-10-15 00:21:31,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:31,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 82 states and 101 transitions. [2024-10-15 00:21:31,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:31,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:31,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 101 transitions. [2024-10-15 00:21:31,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:31,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-10-15 00:21:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 101 transitions. [2024-10-15 00:21:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-15 00:21:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 78 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-10-15 00:21:31,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-10-15 00:21:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-15 00:21:31,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-10-15 00:21:31,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-15 00:21:31,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2024-10-15 00:21:31,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:31,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:31,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:31,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:31,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:31,911 INFO L745 eck$LassoCheckResult]: Stem: 7393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 7387#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 7394#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7388#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7389#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7390#L521 assume !(main_~val~0#1 < 0); 7383#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7384#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7385#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7391#L521 assume !(main_~val~0#1 < 0); 7452#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7451#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7450#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7449#L521 assume !(main_~val~0#1 < 0); 7448#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7447#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7446#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7445#L521 assume !(main_~val~0#1 < 0); 7444#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7443#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7442#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7441#L521 assume !(main_~val~0#1 < 0); 7440#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7439#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7438#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7437#L521 assume !(main_~val~0#1 < 0); 7436#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7435#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7434#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7433#L521 assume !(main_~val~0#1 < 0); 7432#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7431#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7430#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7397#L521 assume !(main_~val~0#1 < 0); 7403#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7398#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7396#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 7395#L519-4 main_~j~0#1 := 0; 7380#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7381#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7428#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7427#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7382#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7379#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7392#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7374#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7375#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7425#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7424#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7423#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7422#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7420#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7419#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7418#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7417#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7415#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7414#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7413#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7412#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7410#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7409#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7408#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7407#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7406#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7402#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7401#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7399#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7377#L527-3 [2024-10-15 00:21:31,911 INFO L747 eck$LassoCheckResult]: Loop: 7377#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7376#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 7377#L527-3 [2024-10-15 00:21:31,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 260997934, now seen corresponding path program 15 times [2024-10-15 00:21:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626947992] [2024-10-15 00:21:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 15 times [2024-10-15 00:21:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525005870] [2024-10-15 00:21:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:31,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1710912947, now seen corresponding path program 7 times [2024-10-15 00:21:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708317213] [2024-10-15 00:21:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:32,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:32,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:35,080 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:35,081 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:35,081 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:35,081 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:35,081 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:35,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:35,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:35,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration19_Lasso [2024-10-15 00:21:35,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:35,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:35,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:35,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:35,570 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:35,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,572 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-15 00:21:35,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-10-15 00:21:35,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,600 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-15 00:21:35,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-10-15 00:21:35,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,626 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-10-15 00:21:35,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:35,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:35,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-10-15 00:21:35,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,660 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-15 00:21:35,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-15 00:21:35,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,685 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-15 00:21:35,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-10-15 00:21:35,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,711 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-15 00:21:35,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-10-15 00:21:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,735 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-15 00:21:35,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-10-15 00:21:35,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,761 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-15 00:21:35,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:35,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:35,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-15 00:21:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,787 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-15 00:21:35,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-15 00:21:35,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,812 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-15 00:21:35,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-15 00:21:35,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,838 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-15 00:21:35,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-10-15 00:21:35,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,863 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-15 00:21:35,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-10-15 00:21:35,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,889 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-15 00:21:35,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:35,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:35,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:35,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-10-15 00:21:35,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,921 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-15 00:21:35,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:35,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:35,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-10-15 00:21:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,948 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-15 00:21:35,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:35,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:35,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:35,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-10-15 00:21:35,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:35,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:35,975 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:35,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-15 00:21:35,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:35,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:35,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:35,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:35,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:35,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:35,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:35,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-10-15 00:21:36,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,003 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-10-15 00:21:36,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-10-15 00:21:36,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,030 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-10-15 00:21:36,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-10-15 00:21:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,057 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-10-15 00:21:36,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:36,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,085 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-10-15 00:21:36,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-10-15 00:21:36,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,113 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-15 00:21:36,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-10-15 00:21:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,145 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-10-15 00:21:36,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-10-15 00:21:36,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,175 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-15 00:21:36,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,204 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-15 00:21:36,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-10-15 00:21:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,232 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-10-15 00:21:36,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:36,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-10-15 00:21:36,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,260 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-10-15 00:21:36,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:36,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:36,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:36,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:36,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:36,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:36,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:36,278 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:36,286 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:21:36,286 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:36,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:36,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:36,288 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:36,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-10-15 00:21:36,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:36,299 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:36,300 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:36,300 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2024-10-15 00:21:36,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-10-15 00:21:36,326 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-10-15 00:21:36,328 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:36,328 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:36,328 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:36,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:36,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 00:21:36,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:36,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:36,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:36,706 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:36,706 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:36,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-10-15 00:21:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:36,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-15 00:21:36,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:36,747 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:36,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:36,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 00:21:36,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:37,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:37,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:37,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:37,167 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:37,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:37,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-10-15 00:21:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:37,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-15 00:21:37,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:37,207 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:37,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 00:21:37,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:37,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:37,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:37,560 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:37,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:37,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 128 transitions. Complement of second has 23 states. [2024-10-15 00:21:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2024-10-15 00:21:37,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-15 00:21:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 70 letters. Loop has 2 letters. [2024-10-15 00:21:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:37,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 4 letters. [2024-10-15 00:21:37,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:37,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 128 transitions. [2024-10-15 00:21:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:37,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 121 transitions. [2024-10-15 00:21:37,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:37,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:37,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 121 transitions. [2024-10-15 00:21:37,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:37,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-10-15 00:21:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 121 transitions. [2024-10-15 00:21:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-10-15 00:21:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 83 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-10-15 00:21:37,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-15 00:21:37,753 INFO L425 stractBuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-15 00:21:37,753 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-15 00:21:37,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 103 transitions. [2024-10-15 00:21:37,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:37,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:37,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:37,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:37,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:37,755 INFO L745 eck$LassoCheckResult]: Stem: 8511#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 8504#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 8512#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8505#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8506#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8507#L521 assume !(main_~val~0#1 < 0); 8499#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8500#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8508#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8509#L521 assume !(main_~val~0#1 < 0); 8541#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8501#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8502#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8537#L521 assume !(main_~val~0#1 < 0); 8536#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8535#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8534#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8533#L521 assume !(main_~val~0#1 < 0); 8532#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8531#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8530#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8529#L521 assume !(main_~val~0#1 < 0); 8528#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8527#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8526#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8525#L521 assume !(main_~val~0#1 < 0); 8524#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8523#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8522#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8521#L521 assume !(main_~val~0#1 < 0); 8520#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8519#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8518#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8515#L521 assume !(main_~val~0#1 < 0); 8517#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8516#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8514#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 8513#L519-4 main_~j~0#1 := 0; 8496#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8497#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8572#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8571#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8498#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8495#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8510#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8490#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8491#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8569#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8568#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8567#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8566#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8564#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8563#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8562#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8561#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8559#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8558#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8557#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8556#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8554#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8553#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8552#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8551#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8549#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8548#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8547#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8546#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8545#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8542#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8540#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8538#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8493#L527-3 [2024-10-15 00:21:37,756 INFO L747 eck$LassoCheckResult]: Loop: 8493#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8492#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 8493#L527-3 [2024-10-15 00:21:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash -785132413, now seen corresponding path program 16 times [2024-10-15 00:21:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695104227] [2024-10-15 00:21:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695104227] [2024-10-15 00:21:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695104227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936659660] [2024-10-15 00:21:38,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:21:38,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:38,122 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:38,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2024-10-15 00:21:38,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:21:38,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:38,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:21:38,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:38,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936659660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:38,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-10-15 00:21:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644741852] [2024-10-15 00:21:38,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:38,740 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 16 times [2024-10-15 00:21:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772114604] [2024-10-15 00:21:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:38,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:38,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:38,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 00:21:38,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-10-15 00:21:38,785 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. cyclomatic complexity: 30 Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:39,023 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-10-15 00:21:39,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 162 transitions. [2024-10-15 00:21:39,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:39,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 91 states and 112 transitions. [2024-10-15 00:21:39,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:39,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:39,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 112 transitions. [2024-10-15 00:21:39,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:39,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-15 00:21:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 112 transitions. [2024-10-15 00:21:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-15 00:21:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 87 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-10-15 00:21:39,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-15 00:21:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-15 00:21:39,027 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-15 00:21:39,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-15 00:21:39,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 108 transitions. [2024-10-15 00:21:39,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:39,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:39,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:39,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:39,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:39,029 INFO L745 eck$LassoCheckResult]: Stem: 9187#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9181#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 9188#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 9182#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 9183#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9184#L521 assume !(main_~val~0#1 < 0); 9177#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9178#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9179#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9185#L521 assume !(main_~val~0#1 < 0); 9255#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9254#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9253#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9252#L521 assume !(main_~val~0#1 < 0); 9251#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9250#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9248#L521 assume !(main_~val~0#1 < 0); 9247#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9246#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9245#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9244#L521 assume !(main_~val~0#1 < 0); 9243#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9241#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9240#L521 assume !(main_~val~0#1 < 0); 9239#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9238#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9237#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9236#L521 assume !(main_~val~0#1 < 0); 9235#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9234#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9233#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9232#L521 assume !(main_~val~0#1 < 0); 9231#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9230#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9229#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9191#L521 assume !(main_~val~0#1 < 0); 9197#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9192#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9190#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 9189#L519-4 main_~j~0#1 := 0; 9174#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9175#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9227#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9226#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9176#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9173#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9186#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9168#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9169#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9224#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9223#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9222#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9221#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9219#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9218#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9217#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9216#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9214#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9213#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9212#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9211#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9209#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9208#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9207#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9206#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9204#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9203#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9202#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9201#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9200#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9196#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9195#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9193#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9171#L527-3 [2024-10-15 00:21:39,029 INFO L747 eck$LassoCheckResult]: Loop: 9171#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9170#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 9171#L527-3 [2024-10-15 00:21:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:39,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1182197124, now seen corresponding path program 17 times [2024-10-15 00:21:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:39,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586927144] [2024-10-15 00:21:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:39,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 17 times [2024-10-15 00:21:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786465920] [2024-10-15 00:21:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:39,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2074898817, now seen corresponding path program 8 times [2024-10-15 00:21:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:39,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188261349] [2024-10-15 00:21:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:39,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:44,490 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:44,490 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:44,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:44,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:44,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:44,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:44,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:44,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:44,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration21_Lasso [2024-10-15 00:21:44,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:44,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:44,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:44,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:44,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:44,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:44,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:44,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:46,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:46,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:46,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,800 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-10-15 00:21:46,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:46,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:46,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:46,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-10-15 00:21:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,825 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-10-15 00:21:46,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:46,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:46,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:46,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-10-15 00:21:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,850 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-10-15 00:21:46,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:46,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:46,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-10-15 00:21:46,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,879 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-10-15 00:21:46,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:46,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:46,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:46,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:46,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,903 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-10-15 00:21:46,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:46,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:46,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:46,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:46,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,929 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-10-15 00:21:46,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:46,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:46,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-10-15 00:21:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,956 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-10-15 00:21:46,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:46,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:46,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:46,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:46,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-10-15 00:21:46,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:46,986 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:46,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-10-15 00:21:46,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:46,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:46,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:46,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:46,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:47,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:47,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:47,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:47,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-10-15 00:21:47,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:47,014 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:47,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-10-15 00:21:47,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:47,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:47,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:47,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:47,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:47,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:47,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:47,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-10-15 00:21:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:47,044 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:47,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-10-15 00:21:47,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:47,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:47,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:47,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:47,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:47,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:47,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:47,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:47,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-10-15 00:21:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:47,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:47,077 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-10-15 00:21:47,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:47,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:47,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:47,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:47,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:47,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:47,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:47,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:47,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-10-15 00:21:47,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:47,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:47,106 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:47,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-10-15 00:21:47,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:47,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:47,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:47,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:47,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:47,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:47,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:47,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:47,145 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:21:47,145 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:47,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:47,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:47,149 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:47,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-10-15 00:21:47,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:47,165 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:47,165 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:47,165 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-10-15 00:21:47,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:47,271 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-10-15 00:21:47,274 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:47,274 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:47,274 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:47,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:21:47,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:47,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:47,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:47,588 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:47,588 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:47,616 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-10-15 00:21:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-15 00:21:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:47,617 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:47,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:47,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:21:47,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:47,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:47,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:47,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:47,917 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:47,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:47,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-10-15 00:21:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:21:47,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-15 00:21:47,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:47,945 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:47,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:48,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:21:48,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:48,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:48,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:48,260 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-15 00:21:48,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:48,505 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 110 states and 141 transitions. Complement of second has 24 states. [2024-10-15 00:21:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:21:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2024-10-15 00:21:48,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-15 00:21:48,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:48,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 78 letters. Loop has 2 letters. [2024-10-15 00:21:48,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:48,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 4 letters. [2024-10-15 00:21:48,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:48,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 141 transitions. [2024-10-15 00:21:48,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:48,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 105 states and 134 transitions. [2024-10-15 00:21:48,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:21:48,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:21:48,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 134 transitions. [2024-10-15 00:21:48,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:48,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-10-15 00:21:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 134 transitions. [2024-10-15 00:21:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-10-15 00:21:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-10-15 00:21:48,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-10-15 00:21:48,517 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-10-15 00:21:48,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-15 00:21:48,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 114 transitions. [2024-10-15 00:21:48,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:48,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:48,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:48,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:48,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:48,519 INFO L745 eck$LassoCheckResult]: Stem: 10444#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10437#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 10445#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10438#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 10439#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10440#L521 assume !(main_~val~0#1 < 0); 10432#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10433#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10441#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10442#L521 assume !(main_~val~0#1 < 0); 10478#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10434#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10435#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10474#L521 assume !(main_~val~0#1 < 0); 10473#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10472#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10471#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10470#L521 assume !(main_~val~0#1 < 0); 10469#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10468#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10467#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10466#L521 assume !(main_~val~0#1 < 0); 10465#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10464#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10463#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10462#L521 assume !(main_~val~0#1 < 0); 10461#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10460#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10459#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10458#L521 assume !(main_~val~0#1 < 0); 10457#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10456#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10455#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10454#L521 assume !(main_~val~0#1 < 0); 10453#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10452#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10451#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10448#L521 assume !(main_~val~0#1 < 0); 10450#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10449#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10447#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 10446#L519-4 main_~j~0#1 := 0; 10429#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10430#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10514#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10513#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10431#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10428#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10443#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10423#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10424#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10511#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10510#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10509#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10508#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10506#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10505#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10504#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10503#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10501#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10500#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10499#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10498#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10496#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10495#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10494#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10493#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10491#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10490#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10489#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10488#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10486#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10485#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10484#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10483#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10482#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10479#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10477#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10475#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10426#L527-3 [2024-10-15 00:21:48,519 INFO L747 eck$LassoCheckResult]: Loop: 10426#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10425#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 10426#L527-3 [2024-10-15 00:21:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1112937681, now seen corresponding path program 18 times [2024-10-15 00:21:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100340095] [2024-10-15 00:21:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:21:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100340095] [2024-10-15 00:21:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100340095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:21:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219386871] [2024-10-15 00:21:48,923 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:21:48,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:21:48,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:48,924 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:21:48,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2024-10-15 00:21:49,089 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-10-15 00:21:49,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:21:49,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 00:21:49,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:49,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:21:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219386871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:21:49,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:21:49,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-10-15 00:21:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092875775] [2024-10-15 00:21:49,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:21:49,613 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:21:49,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 18 times [2024-10-15 00:21:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999578032] [2024-10-15 00:21:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:21:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-15 00:21:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 00:21:49,650 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. cyclomatic complexity: 33 Second operand has 35 states, 34 states have (on average 3.764705882352941) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:21:49,814 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2024-10-15 00:21:49,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 179 transitions. [2024-10-15 00:21:49,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:49,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 100 states and 123 transitions. [2024-10-15 00:21:49,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:21:49,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:21:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 123 transitions. [2024-10-15 00:21:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:21:49,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-10-15 00:21:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 123 transitions. [2024-10-15 00:21:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-10-15 00:21:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-10-15 00:21:49,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-15 00:21:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-15 00:21:49,819 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-15 00:21:49,819 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-15 00:21:49,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 119 transitions. [2024-10-15 00:21:49,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:21:49,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:21:49,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:21:49,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:21:49,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:21:49,820 INFO L745 eck$LassoCheckResult]: Stem: 11194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11188#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 11195#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11189#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11190#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11191#L521 assume !(main_~val~0#1 < 0); 11184#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11185#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11186#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11192#L521 assume !(main_~val~0#1 < 0); 11271#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11270#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11269#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11268#L521 assume !(main_~val~0#1 < 0); 11267#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11266#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11265#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11264#L521 assume !(main_~val~0#1 < 0); 11263#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11262#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11261#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11260#L521 assume !(main_~val~0#1 < 0); 11259#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11258#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11257#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11256#L521 assume !(main_~val~0#1 < 0); 11255#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11254#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11253#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11252#L521 assume !(main_~val~0#1 < 0); 11251#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11250#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11248#L521 assume !(main_~val~0#1 < 0); 11247#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11246#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11245#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11244#L521 assume !(main_~val~0#1 < 0); 11243#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11241#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11198#L521 assume !(main_~val~0#1 < 0); 11204#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11199#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11197#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 11196#L519-4 main_~j~0#1 := 0; 11181#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11182#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11239#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11238#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11183#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11180#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11193#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11175#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11176#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11236#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11235#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11234#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11233#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11231#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11230#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11229#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11228#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11226#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11225#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11224#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11223#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11221#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11220#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11219#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11218#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11216#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11215#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11214#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11213#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11211#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11210#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11209#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11208#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11207#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11203#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11202#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11200#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11178#L527-3 [2024-10-15 00:21:49,821 INFO L747 eck$LassoCheckResult]: Loop: 11178#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11177#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 11178#L527-3 [2024-10-15 00:21:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1373220406, now seen corresponding path program 19 times [2024-10-15 00:21:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604437336] [2024-10-15 00:21:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:49,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 19 times [2024-10-15 00:21:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700287595] [2024-10-15 00:21:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1109848753, now seen corresponding path program 9 times [2024-10-15 00:21:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:21:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314831075] [2024-10-15 00:21:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:21:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:21:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:21:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:21:49,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:21:55,813 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 330 DAG size of output: 239 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:21:56,180 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:21:56,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:21:56,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:21:56,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:21:56,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:21:56,181 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:56,181 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:21:56,181 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:21:56,181 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration23_Lasso [2024-10-15 00:21:56,181 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:21:56,181 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:21:56,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:56,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:21:57,718 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:21:57,719 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:21:57,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,721 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-10-15 00:21:57,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-10-15 00:21:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,746 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-10-15 00:21:57,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:57,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:57,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-10-15 00:21:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,774 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-10-15 00:21:57,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:57,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,801 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-10-15 00:21:57,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,834 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-10-15 00:21:57,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,861 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-10-15 00:21:57,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:57,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:57,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-10-15 00:21:57,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,889 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-10-15 00:21:57,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-10-15 00:21:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,915 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-10-15 00:21:57,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-10-15 00:21:57,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,939 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-10-15 00:21:57,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:57,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:57,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:57,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-10-15 00:21:57,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,964 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-10-15 00:21:57,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:57,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:57,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:57,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:57,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:57,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:57,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:57,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:57,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-10-15 00:21:57,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:57,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:57,991 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:57,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-10-15 00:21:57,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:58,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:58,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:58,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-10-15 00:21:58,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,017 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-10-15 00:21:58,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:58,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:58,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:58,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-10-15 00:21:58,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,043 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-10-15 00:21:58,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:58,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:58,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:58,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-10-15 00:21:58,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,068 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-10-15 00:21:58,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:21:58,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:21:58,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:21:58,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-10-15 00:21:58,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,093 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-10-15 00:21:58,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-10-15 00:21:58,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,123 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-10-15 00:21:58,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-10-15 00:21:58,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,149 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-10-15 00:21:58,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-10-15 00:21:58,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,183 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-10-15 00:21:58,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,213 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-10-15 00:21:58,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:58,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,244 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-10-15 00:21:58,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:58,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,277 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-10-15 00:21:58,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-10-15 00:21:58,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,307 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-10-15 00:21:58,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-10-15 00:21:58,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,337 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-10-15 00:21:58,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:21:58,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-10-15 00:21:58,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,367 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-10-15 00:21:58,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:21:58,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:21:58,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:21:58,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:21:58,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:21:58,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:21:58,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:21:58,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:21:58,397 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-15 00:21:58,398 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-15 00:21:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:21:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:21:58,399 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:21:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-10-15 00:21:58,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:21:58,411 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:21:58,411 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:21:58,411 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1 Supporting invariants [] [2024-10-15 00:21:58,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-10-15 00:21:58,514 INFO L156 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2024-10-15 00:21:58,515 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:21:58,516 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:21:58,516 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:21:58,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:58,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 00:21:58,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:58,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2024-10-15 00:21:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:58,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:58,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:58,994 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-15 00:21:58,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:59,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-10-15 00:21:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:59,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-15 00:21:59,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:59,034 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:59,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 00:21:59,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:59,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:21:59,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:21:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:21:59,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-15 00:21:59,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:59,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-10-15 00:21:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:21:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:21:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:21:59,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-15 00:21:59,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:21:59,509 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:21:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:21:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:21:59,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 00:21:59,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:00,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:22:00,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:00,036 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-15 00:22:00,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:00,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 120 states and 154 transitions. Complement of second has 27 states. [2024-10-15 00:22:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:22:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2024-10-15 00:22:00,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-15 00:22:00,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:00,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 86 letters. Loop has 2 letters. [2024-10-15 00:22:00,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:00,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 4 letters. [2024-10-15 00:22:00,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:00,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2024-10-15 00:22:00,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:00,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 147 transitions. [2024-10-15 00:22:00,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:22:00,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:22:00,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2024-10-15 00:22:00,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:00,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-10-15 00:22:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2024-10-15 00:22:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-10-15 00:22:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-15 00:22:00,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-15 00:22:00,300 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-15 00:22:00,300 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-15 00:22:00,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 125 transitions. [2024-10-15 00:22:00,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:00,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:00,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:00,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:00,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:00,302 INFO L745 eck$LassoCheckResult]: Stem: 12658#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 12651#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 12659#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12652#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 12653#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12654#L521 assume !(main_~val~0#1 < 0); 12646#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12647#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12655#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12656#L521 assume !(main_~val~0#1 < 0); 12696#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12648#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12649#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12692#L521 assume !(main_~val~0#1 < 0); 12691#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12690#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12689#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12688#L521 assume !(main_~val~0#1 < 0); 12687#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12686#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12685#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12684#L521 assume !(main_~val~0#1 < 0); 12683#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12682#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12681#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12680#L521 assume !(main_~val~0#1 < 0); 12679#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12678#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12677#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12676#L521 assume !(main_~val~0#1 < 0); 12675#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12674#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12673#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12672#L521 assume !(main_~val~0#1 < 0); 12671#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12670#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12669#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12668#L521 assume !(main_~val~0#1 < 0); 12667#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12666#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12665#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12662#L521 assume !(main_~val~0#1 < 0); 12664#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12663#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12661#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 12660#L519-4 main_~j~0#1 := 0; 12643#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12644#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12737#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12736#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12645#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12642#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12657#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12637#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12638#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12734#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12733#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12732#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12731#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12729#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12728#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12727#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12726#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12724#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12723#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12722#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12721#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12719#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12718#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12717#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12716#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12714#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12713#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12712#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12711#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12709#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12708#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12707#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12706#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12704#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12703#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12702#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12701#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12700#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12697#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12695#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12693#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12640#L527-3 [2024-10-15 00:22:00,302 INFO L747 eck$LassoCheckResult]: Loop: 12640#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12639#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 12640#L527-3 [2024-10-15 00:22:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1412762337, now seen corresponding path program 20 times [2024-10-15 00:22:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381132512] [2024-10-15 00:22:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381132512] [2024-10-15 00:22:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381132512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252167172] [2024-10-15 00:22:00,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:22:00,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:00,758 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:00,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2024-10-15 00:22:00,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:22:00,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:22:00,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-15 00:22:00,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:01,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252167172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:01,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-10-15 00:22:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823006639] [2024-10-15 00:22:01,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:01,459 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 20 times [2024-10-15 00:22:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864033429] [2024-10-15 00:22:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-15 00:22:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2024-10-15 00:22:01,500 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. cyclomatic complexity: 36 Second operand has 38 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 38 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:01,816 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2024-10-15 00:22:01,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 196 transitions. [2024-10-15 00:22:01,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:01,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 109 states and 134 transitions. [2024-10-15 00:22:01,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:22:01,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:22:01,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 134 transitions. [2024-10-15 00:22:01,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:01,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-10-15 00:22:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 134 transitions. [2024-10-15 00:22:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-10-15 00:22:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 105 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2024-10-15 00:22:01,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-10-15 00:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-15 00:22:01,823 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-10-15 00:22:01,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-15 00:22:01,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 130 transitions. [2024-10-15 00:22:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:01,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:01,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:01,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:01,825 INFO L745 eck$LassoCheckResult]: Stem: 13482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13475#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 13476#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 13483#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 13477#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 13478#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13479#L521 assume !(main_~val~0#1 < 0); 13472#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13473#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13474#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13480#L521 assume !(main_~val~0#1 < 0); 13568#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13567#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13566#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13565#L521 assume !(main_~val~0#1 < 0); 13564#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13563#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13562#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13561#L521 assume !(main_~val~0#1 < 0); 13560#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13559#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13558#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13557#L521 assume !(main_~val~0#1 < 0); 13556#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13555#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13554#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13553#L521 assume !(main_~val~0#1 < 0); 13552#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13551#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13550#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13549#L521 assume !(main_~val~0#1 < 0); 13548#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13547#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13546#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13545#L521 assume !(main_~val~0#1 < 0); 13544#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13543#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13542#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13541#L521 assume !(main_~val~0#1 < 0); 13540#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13539#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13538#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13537#L521 assume !(main_~val~0#1 < 0); 13536#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13535#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13534#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13486#L521 assume !(main_~val~0#1 < 0); 13492#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13487#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13485#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 13484#L519-4 main_~j~0#1 := 0; 13469#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13470#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13532#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13531#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13471#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13468#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13481#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13463#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13464#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13529#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13528#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13527#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13526#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13524#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13523#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13522#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13521#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13519#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13518#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13517#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13516#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13514#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13513#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13512#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13511#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13509#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13508#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13507#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13506#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13504#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13503#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13502#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13501#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13499#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13498#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13497#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13496#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13495#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13491#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13490#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13488#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13466#L527-3 [2024-10-15 00:22:01,825 INFO L747 eck$LassoCheckResult]: Loop: 13466#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13465#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 13466#L527-3 [2024-10-15 00:22:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2010175208, now seen corresponding path program 21 times [2024-10-15 00:22:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820048810] [2024-10-15 00:22:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 21 times [2024-10-15 00:22:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366180922] [2024-10-15 00:22:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 956909853, now seen corresponding path program 10 times [2024-10-15 00:22:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133558259] [2024-10-15 00:22:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:01,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:12,323 WARN L286 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 359 DAG size of output: 260 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:22:12,832 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:22:12,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:22:12,833 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:22:12,833 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:22:12,833 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:22:12,833 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:12,833 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:22:12,833 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:22:12,833 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration25_Lasso [2024-10-15 00:22:12,833 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:22:12,833 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:22:12,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:12,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:12,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:12,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:12,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:22:14,600 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:22:14,600 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:22:14,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,601 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-10-15 00:22:14,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-10-15 00:22:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,631 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-10-15 00:22:14,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:14,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:14,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:14,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-10-15 00:22:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,657 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-10-15 00:22:14,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-10-15 00:22:14,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,684 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-10-15 00:22:14,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:22:14,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:22:14,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:22:14,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2024-10-15 00:22:14,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,710 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-10-15 00:22:14,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-10-15 00:22:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,739 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-10-15 00:22:14,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-10-15 00:22:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,770 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-10-15 00:22:14,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-10-15 00:22:14,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,802 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-10-15 00:22:14,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:14,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,835 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-10-15 00:22:14,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2024-10-15 00:22:14,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,867 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-10-15 00:22:14,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-10-15 00:22:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,900 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-10-15 00:22:14,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-10-15 00:22:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,931 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-10-15 00:22:14,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-10-15 00:22:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,965 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-10-15 00:22:14,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:14,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:14,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:14,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:14,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:14,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:14,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:14,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:14,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-10-15 00:22:14,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:14,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:14,995 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:14,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-10-15 00:22:14,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:15,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:15,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:15,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:15,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:15,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:15,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:15,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:22:15,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-10-15 00:22:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:15,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:15,026 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:15,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-10-15 00:22:15,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:22:15,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:22:15,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:22:15,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:22:15,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:22:15,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:22:15,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:22:15,046 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:22:15,050 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-15 00:22:15,050 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:22:15,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:22:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:15,052 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:22:15,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-10-15 00:22:15,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:22:15,064 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:22:15,064 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:22:15,064 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1 Supporting invariants [] [2024-10-15 00:22:15,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-10-15 00:22:15,173 INFO L156 tatePredicateManager]: 44 out of 45 supporting invariants were superfluous and have been removed [2024-10-15 00:22:15,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:22:15,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:22:15,175 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-15 00:22:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:15,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 00:22:15,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:15,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:22:15,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:15,628 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-15 00:22:15,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:15,665 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-10-15 00:22:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:22:15,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-15 00:22:15,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:15,666 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:22:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:15,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 00:22:15,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:15,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2024-10-15 00:22:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:16,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:22:16,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:16,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-15 00:22:16,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:16,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-10-15 00:22:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:22:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:22:16,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-15 00:22:16,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:16,267 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:22:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:16,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-15 00:22:16,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:16,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:22:16,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:16,716 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-15 00:22:16,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:16,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 130 states and 167 transitions. Complement of second has 29 states. [2024-10-15 00:22:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-15 00:22:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 87 transitions. [2024-10-15 00:22:16,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-15 00:22:16,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:16,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 94 letters. Loop has 2 letters. [2024-10-15 00:22:16,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:16,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 4 letters. [2024-10-15 00:22:16,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:22:16,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 167 transitions. [2024-10-15 00:22:16,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:17,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 160 transitions. [2024-10-15 00:22:17,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-15 00:22:17,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-15 00:22:17,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 160 transitions. [2024-10-15 00:22:17,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:17,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-10-15 00:22:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 160 transitions. [2024-10-15 00:22:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-10-15 00:22:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 110 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-10-15 00:22:17,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-10-15 00:22:17,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-10-15 00:22:17,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-15 00:22:17,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 136 transitions. [2024-10-15 00:22:17,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:17,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:17,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:17,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:17,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:17,005 INFO L745 eck$LassoCheckResult]: Stem: 15077#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15070#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 15078#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15071#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15072#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15073#L521 assume !(main_~val~0#1 < 0); 15065#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15066#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15074#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15075#L521 assume !(main_~val~0#1 < 0); 15119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15067#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15068#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15115#L521 assume !(main_~val~0#1 < 0); 15114#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15113#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15112#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15111#L521 assume !(main_~val~0#1 < 0); 15110#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15109#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15108#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15107#L521 assume !(main_~val~0#1 < 0); 15106#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15105#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15104#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15103#L521 assume !(main_~val~0#1 < 0); 15102#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15101#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15100#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15099#L521 assume !(main_~val~0#1 < 0); 15098#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15097#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15096#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15095#L521 assume !(main_~val~0#1 < 0); 15094#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15093#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15092#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15091#L521 assume !(main_~val~0#1 < 0); 15090#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15089#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15088#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15087#L521 assume !(main_~val~0#1 < 0); 15086#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15085#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15084#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15081#L521 assume !(main_~val~0#1 < 0); 15083#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15082#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15080#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 15079#L519-4 main_~j~0#1 := 0; 15062#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15063#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15165#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15164#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15064#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15061#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15076#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15056#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15057#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15162#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15161#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15160#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15159#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15157#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15156#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15155#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15154#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15152#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15151#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15150#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15149#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15147#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15146#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15145#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15144#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15142#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15141#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15140#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15139#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15137#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15136#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15135#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15134#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15132#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15131#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15130#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15129#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15127#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15126#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15125#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15124#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15123#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15120#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15118#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15116#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15059#L527-3 [2024-10-15 00:22:17,005 INFO L747 eck$LassoCheckResult]: Loop: 15059#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15058#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15059#L527-3 [2024-10-15 00:22:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 467367277, now seen corresponding path program 22 times [2024-10-15 00:22:17,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586299684] [2024-10-15 00:22:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:22:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:17,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:22:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586299684] [2024-10-15 00:22:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586299684] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:22:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91952017] [2024-10-15 00:22:17,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:22:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:22:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:22:17,472 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:22:17,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2024-10-15 00:22:17,592 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:22:17,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:22:17,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 00:22:17,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:22:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:18,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:22:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:22:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91952017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:22:18,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:22:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-10-15 00:22:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690031146] [2024-10-15 00:22:18,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:22:18,354 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:22:18,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 22 times [2024-10-15 00:22:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270481222] [2024-10-15 00:22:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:22:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 00:22:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 00:22:18,398 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. cyclomatic complexity: 39 Second operand has 41 states, 40 states have (on average 3.8) internal successors, (152), 41 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:22:18,614 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-10-15 00:22:18,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 213 transitions. [2024-10-15 00:22:18,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:18,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 118 states and 145 transitions. [2024-10-15 00:22:18,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:22:18,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:22:18,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 145 transitions. [2024-10-15 00:22:18,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:22:18,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-10-15 00:22:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 145 transitions. [2024-10-15 00:22:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-15 00:22:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:22:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-10-15 00:22:18,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-15 00:22:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-15 00:22:18,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-15 00:22:18,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-15 00:22:18,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 141 transitions. [2024-10-15 00:22:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:22:18,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:22:18,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:22:18,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:22:18,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:22:18,622 INFO L745 eck$LassoCheckResult]: Stem: 15975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15968#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15969#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 15976#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15970#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15971#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15972#L521 assume !(main_~val~0#1 < 0); 15965#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15966#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15967#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15973#L521 assume !(main_~val~0#1 < 0); 16070#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16069#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16068#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16067#L521 assume !(main_~val~0#1 < 0); 16066#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16065#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16064#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16063#L521 assume !(main_~val~0#1 < 0); 16062#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16061#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16060#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16059#L521 assume !(main_~val~0#1 < 0); 16058#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16057#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16056#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16055#L521 assume !(main_~val~0#1 < 0); 16054#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16053#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16052#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16051#L521 assume !(main_~val~0#1 < 0); 16050#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16049#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16048#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16047#L521 assume !(main_~val~0#1 < 0); 16046#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16045#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16044#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16043#L521 assume !(main_~val~0#1 < 0); 16042#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16041#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16040#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16039#L521 assume !(main_~val~0#1 < 0); 16038#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16037#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16036#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16035#L521 assume !(main_~val~0#1 < 0); 16034#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16033#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16032#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15979#L521 assume !(main_~val~0#1 < 0); 15985#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15980#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15978#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 15977#L519-4 main_~j~0#1 := 0; 15962#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15963#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16030#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16029#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15964#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15961#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15974#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15956#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15957#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16027#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16026#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16025#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16024#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16022#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16021#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16020#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16019#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16017#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16016#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16015#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16014#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16012#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16011#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16010#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16009#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16007#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16006#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16005#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16004#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16002#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16001#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16000#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15999#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15997#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15996#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15995#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15994#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15992#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15991#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15990#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15989#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15988#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15984#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15983#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15981#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15959#L527-3 [2024-10-15 00:22:18,622 INFO L747 eck$LassoCheckResult]: Loop: 15959#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15958#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15959#L527-3 [2024-10-15 00:22:18,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash 753705062, now seen corresponding path program 23 times [2024-10-15 00:22:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596529128] [2024-10-15 00:22:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 23 times [2024-10-15 00:22:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393655593] [2024-10-15 00:22:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:22:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:22:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1538906901, now seen corresponding path program 11 times [2024-10-15 00:22:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:22:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690310630] [2024-10-15 00:22:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:22:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:22:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:22:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:22:18,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace