./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/array02-alloca-2.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 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:44:47,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:44:47,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:44:47,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:44:47,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:44:47,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:44:47,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:44:47,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:44:47,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:44:47,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:44:47,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:44:47,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:44:47,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:44:47,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:44:47,341 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:44:47,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:44:47,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:44:47,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:44:47,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:44:47,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:44:47,343 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:44:47,343 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2025-03-04 15:44:47,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:44:47,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:44:47,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:44:47,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:44:47,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:44:47,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-03-04 15:44:48,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac3f815/02ca9d7159774892a864202ff7bcaf5c/FLAG774ba332a [2025-03-04 15:44:48,948 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:44:48,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-03-04 15:44:48,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac3f815/02ca9d7159774892a864202ff7bcaf5c/FLAG774ba332a [2025-03-04 15:44:48,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ac3f815/02ca9d7159774892a864202ff7bcaf5c [2025-03-04 15:44:48,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:44:48,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:44:48,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:48,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:44:48,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:44:48,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:48" (1/1) ... [2025-03-04 15:44:48,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2507337a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:48, skipping insertion in model container [2025-03-04 15:44:48,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:48" (1/1) ... [2025-03-04 15:44:49,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:44:49,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:49,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:44:49,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:49,293 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:44:49,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49 WrapperNode [2025-03-04 15:44:49,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:49,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:49,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:44:49,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:44:49,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,330 INFO L138 Inliner]: procedures = 116, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-04 15:44:49,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:49,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:44:49,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:44:49,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:44:49,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,350 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-04 15:44:49,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:44:49,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:44:49,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:44:49,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:44:49,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (1/1) ... [2025-03-04 15:44:49,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,395 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) [2025-03-04 15:44:49,398 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 [2025-03-04 15:44:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:44:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:44:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:44:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:44:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:44:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:44:49,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:44:49,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:44:49,566 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 15:44:49,567 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:44:49,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:44:49,572 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:44:49,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:49 BoogieIcfgContainer [2025-03-04 15:44:49,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:44:49,573 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:44:49,573 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:44:49,577 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:44:49,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:49,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:44:48" (1/3) ... [2025-03-04 15:44:49,578 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73de1475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:49, skipping insertion in model container [2025-03-04 15:44:49,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:49,578 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:49" (2/3) ... [2025-03-04 15:44:49,578 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73de1475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:49, skipping insertion in model container [2025-03-04 15:44:49,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:49,579 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:49" (3/3) ... [2025-03-04 15:44:49,579 INFO L363 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2025-03-04 15:44:49,616 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:44:49,616 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:44:49,617 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:44:49,617 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:44:49,617 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:44:49,617 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:44:49,618 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:44:49,618 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:44:49,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) 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) [2025-03-04 15:44:49,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-04 15:44:49,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:49,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:49,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:44:49,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:49,638 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:44:49,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) 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) [2025-03-04 15:44:49,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-04 15:44:49,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:49,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:49,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:44:49,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:49,645 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" [2025-03-04 15:44:49,645 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-04 15:44:49,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1630526, now seen corresponding path program 1 times [2025-03-04 15:44:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865352005] [2025-03-04 15:44:49,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:49,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:49,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:49,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:49,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:49,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-03-04 15:44:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155049109] [2025-03-04 15:44:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:49,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:49,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:49,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:49,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:49,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 50546324, now seen corresponding path program 1 times [2025-03-04 15:44:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429167072] [2025-03-04 15:44:49,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:49,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:49,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:49,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:49,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:49,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:49,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:49,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:50,068 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:50,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:50,069 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:50,069 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:50,069 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:50,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:50,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:50,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2025-03-04 15:44:50,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:50,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:50,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:50,483 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,486 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) [2025-03-04 15:44:50,488 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 [2025-03-04 15:44:50,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 [2025-03-04 15:44:50,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:50,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:50,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:50,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:50,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:50,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:50,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:50,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,517 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) [2025-03-04 15:44:50,518 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 [2025-03-04 15:44:50,520 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 [2025-03-04 15:44:50,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:50,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:50,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:50,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:50,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:50,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:50,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:50,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:50,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,539 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) [2025-03-04 15:44:50,541 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 [2025-03-04 15:44:50,542 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 [2025-03-04 15:44:50,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:50,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:50,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:50,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:50,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:50,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:50,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:50,569 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 [2025-03-04 15:44:50,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,573 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) [2025-03-04 15:44:50,574 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 [2025-03-04 15:44:50,575 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 [2025-03-04 15:44:50,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:50,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:50,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:50,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:50,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:50,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:50,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:50,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:50,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,602 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) [2025-03-04 15:44:50,604 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 [2025-03-04 15:44:50,604 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 [2025-03-04 15:44:50,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:50,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:50,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:50,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:50,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:50,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:50,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:50,651 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:50,653 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-04 15:44:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,656 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) [2025-03-04 15:44:50,658 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 [2025-03-04 15:44:50,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:50,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:50,670 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:50,670 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2025-03-04 15:44:50,676 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 [2025-03-04 15:44:50,683 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:44:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:50,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:50,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:50,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:50,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:50,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:44:50,768 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-03-04 15:44:50,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) 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). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 17 states and 25 transitions. Complement of second has 3 states. [2025-03-04 15:44:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-03-04 15:44:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-04 15:44:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-04 15:44:50,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:50,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 15:44:50,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:50,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:44:50,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:50,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 25 transitions. [2025-03-04 15:44:50,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:50,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 20 transitions. [2025-03-04 15:44:50,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:44:50,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:44:50,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-03-04 15:44:50,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:50,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-03-04 15:44:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-03-04 15:44:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-04 15:44:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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) [2025-03-04 15:44:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2025-03-04 15:44:50,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-04 15:44:50,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-04 15:44:50,823 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:44:50,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2025-03-04 15:44:50,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:50,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:50,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:50,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:44:50,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:44:50,824 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:50,824 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume !true;" "assume !true;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-04 15:44:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash 50546323, now seen corresponding path program 1 times [2025-03-04 15:44:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388842817] [2025-03-04 15:44:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:50,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:50,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388842817] [2025-03-04 15:44:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388842817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:50,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115546357] [2025-03-04 15:44:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:50,908 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1384090, now seen corresponding path program 1 times [2025-03-04 15:44:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411779188] [2025-03-04 15:44:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:50,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411779188] [2025-03-04 15:44:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411779188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:44:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145799582] [2025-03-04 15:44:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:50,919 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:44:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:50,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:44:50,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:44:50,923 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2025-03-04 15:44:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:50,925 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2025-03-04 15:44:50,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-04 15:44:50,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:50,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:44:50,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:44:50,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:44:50,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-04 15:44:50,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:50,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:44:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-04 15:44:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:44:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) [2025-03-04 15:44:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:44:50,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:44:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:44:50,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:44:50,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:44:50,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-04 15:44:50,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:50,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:50,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:50,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:44:50,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:44:50,931 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:50,931 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-04 15:44:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 50546323, now seen corresponding path program 2 times [2025-03-04 15:44:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330685849] [2025-03-04 15:44:50,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:50,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:50,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:50,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330685849] [2025-03-04 15:44:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330685849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178173910] [2025-03-04 15:44:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:50,993 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1329281304, now seen corresponding path program 1 times [2025-03-04 15:44:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743859186] [2025-03-04 15:44:50,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:51,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:44:51,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:44:51,048 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-04 15:44:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:51,058 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2025-03-04 15:44:51,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-03-04 15:44:51,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:51,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2025-03-04 15:44:51,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:44:51,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:44:51,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-04 15:44:51,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:51,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:44:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-04 15:44:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:44:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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) [2025-03-04 15:44:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-04 15:44:51,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:44:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:44:51,062 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-04 15:44:51,062 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:44:51,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-04 15:44:51,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:44:51,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:51,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:51,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:44:51,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:44:51,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:51,063 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-04 15:44:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936061, now seen corresponding path program 1 times [2025-03-04 15:44:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828086880] [2025-03-04 15:44:51,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:51,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:51,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:51,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1329281304, now seen corresponding path program 2 times [2025-03-04 15:44:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960480016] [2025-03-04 15:44:51,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:51,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:51,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:51,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:51,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1638848532, now seen corresponding path program 1 times [2025-03-04 15:44:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973290975] [2025-03-04 15:44:51,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:51,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:51,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:51,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:51,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:51,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:51,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:51,194 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 [2025-03-04 15:44:51,363 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:51,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:51,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:51,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:51,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:51,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:51,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:51,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2025-03-04 15:44:51,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:51,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:51,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,659 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:51,659 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,661 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) [2025-03-04 15:44:51,664 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 [2025-03-04 15:44:51,664 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 [2025-03-04 15:44:51,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,681 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 [2025-03-04 15:44:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,683 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) [2025-03-04 15:44:51,684 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 [2025-03-04 15:44:51,684 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 [2025-03-04 15:44:51,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,701 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 [2025-03-04 15:44:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,703 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) [2025-03-04 15:44:51,704 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 [2025-03-04 15:44:51,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 [2025-03-04 15:44:51,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:44:51,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,724 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) [2025-03-04 15:44:51,728 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 [2025-03-04 15:44:51,728 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 [2025-03-04 15:44:51,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:44:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,747 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) [2025-03-04 15:44:51,748 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 [2025-03-04 15:44:51,749 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 [2025-03-04 15:44:51,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,766 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 [2025-03-04 15:44:51,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,768 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) [2025-03-04 15:44:51,770 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 [2025-03-04 15:44:51,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 [2025-03-04 15:44:51,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,791 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) [2025-03-04 15:44:51,791 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 [2025-03-04 15:44:51,792 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 [2025-03-04 15:44:51,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:44:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,813 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) [2025-03-04 15:44:51,814 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 [2025-03-04 15:44:51,815 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 [2025-03-04 15:44:51,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,832 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 [2025-03-04 15:44:51,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,834 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) [2025-03-04 15:44:51,836 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 [2025-03-04 15:44:51,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 [2025-03-04 15:44:51,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,857 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) [2025-03-04 15:44:51,858 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 [2025-03-04 15:44:51,860 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 [2025-03-04 15:44:51,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:44:51,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,879 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) [2025-03-04 15:44:51,881 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 [2025-03-04 15:44:51,883 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 [2025-03-04 15:44:51,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,904 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2025-03-04 15:44:51,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:44:51,907 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 [2025-03-04 15:44:51,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:51,947 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:44:51,947 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:44:51,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,949 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) [2025-03-04 15:44:51,951 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 [2025-03-04 15:44:51,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:51,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:51,963 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:51,963 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2025-03-04 15:44:51,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,989 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:44:51,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:52,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:52,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:52,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:52,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:52,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:52,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:52,062 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 [2025-03-04 15:44:52,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 15:44:52,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19 states and 26 transitions. Complement of second has 4 states. [2025-03-04 15:44:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2025-03-04 15:44:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-03-04 15:44:52,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-04 15:44:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-04 15:44:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 6 letters. Loop has 12 letters. [2025-03-04 15:44:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-04 15:44:52,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:52,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 25 transitions. [2025-03-04 15:44:52,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:44:52,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:44:52,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2025-03-04 15:44:52,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:52,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-04 15:44:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2025-03-04 15:44:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-04 15:44:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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) [2025-03-04 15:44:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:44:52,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:44:52,090 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:44:52,090 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:44:52,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-04 15:44:52,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:52,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:52,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:52,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:52,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:52,095 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:52,095 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:52,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1330377650, now seen corresponding path program 1 times [2025-03-04 15:44:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580470867] [2025-03-04 15:44:52,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:52,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:52,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:52,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:52,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 1 times [2025-03-04 15:44:52,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930149567] [2025-03-04 15:44:52,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:52,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1407332143, now seen corresponding path program 1 times [2025-03-04 15:44:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502454937] [2025-03-04 15:44:52,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:52,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:52,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:52,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,344 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:52,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:52,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:52,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:52,344 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:52,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:52,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:52,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2025-03-04 15:44:52,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:52,345 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:52,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:52,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:52,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,659 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) [2025-03-04 15:44:52,660 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 [2025-03-04 15:44:52,660 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 [2025-03-04 15:44:52,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:44:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,679 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) [2025-03-04 15:44:52,680 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 [2025-03-04 15:44:52,681 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 [2025-03-04 15:44:52,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:44:52,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,698 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2025-03-04 15:44:52,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:44:52,699 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 [2025-03-04 15:44:52,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:52,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,717 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) [2025-03-04 15:44:52,718 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 [2025-03-04 15:44:52,719 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 [2025-03-04 15:44:52,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:52,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:52,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:44:52,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,740 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) [2025-03-04 15:44:52,740 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 [2025-03-04 15:44:52,741 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 [2025-03-04 15:44:52,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:44:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,759 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) [2025-03-04 15:44:52,760 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 [2025-03-04 15:44:52,761 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 [2025-03-04 15:44:52,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:44:52,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,779 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) [2025-03-04 15:44:52,780 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 [2025-03-04 15:44:52,780 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 [2025-03-04 15:44:52,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:44:52,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,802 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) [2025-03-04 15:44:52,802 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 [2025-03-04 15:44:52,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 [2025-03-04 15:44:52,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:52,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:52,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:44:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,824 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) [2025-03-04 15:44:52,825 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 [2025-03-04 15:44:52,825 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 [2025-03-04 15:44:52,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:44:52,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,843 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) [2025-03-04 15:44:52,844 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 [2025-03-04 15:44:52,845 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 [2025-03-04 15:44:52,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:44:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,862 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) [2025-03-04 15:44:52,863 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 [2025-03-04 15:44:52,864 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 [2025-03-04 15:44:52,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:44:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,884 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) [2025-03-04 15:44:52,885 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 [2025-03-04 15:44:52,885 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 [2025-03-04 15:44:52,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:52,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:52,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:44:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,907 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) [2025-03-04 15:44:52,908 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 [2025-03-04 15:44:52,908 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 [2025-03-04 15:44:52,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:52,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:52,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:52,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:44:52,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,931 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) [2025-03-04 15:44:52,931 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 [2025-03-04 15:44:52,932 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 [2025-03-04 15:44:52,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:52,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:52,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:52,953 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 [2025-03-04 15:44:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,954 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) [2025-03-04 15:44:52,955 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 [2025-03-04 15:44:52,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 [2025-03-04 15:44:52,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:52,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:52,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:52,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:52,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:52,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:52,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:52,985 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:44:52,985 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:44:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,987 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) [2025-03-04 15:44:52,987 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 [2025-03-04 15:44:52,988 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:52,998 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:52,998 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:52,998 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2 Supporting invariants [] [2025-03-04 15:44:53,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,010 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:44:53,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:53,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:53,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:44:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:53,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:53,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:53,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:53,107 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 [2025-03-04 15:44:53,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) [2025-03-04 15:44:53,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 45 transitions. Complement of second has 9 states. [2025-03-04 15:44:53,151 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 [2025-03-04 15:44:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) [2025-03-04 15:44:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2025-03-04 15:44:53,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-04 15:44:53,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:53,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-04 15:44:53,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:53,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:44:53,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:53,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2025-03-04 15:44:53,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:53,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 40 transitions. [2025-03-04 15:44:53,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:44:53,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 15:44:53,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2025-03-04 15:44:53,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:53,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-04 15:44:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2025-03-04 15:44:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-03-04 15:44:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 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) [2025-03-04 15:44:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-03-04 15:44:53,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:44:53,155 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:44:53,155 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:44:53,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2025-03-04 15:44:53,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:53,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:53,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:53,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:53,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:53,155 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-04 15:44:53,156 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-04 15:44:53,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1407332144, now seen corresponding path program 1 times [2025-03-04 15:44:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995087589] [2025-03-04 15:44:53,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:53,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:53,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:53,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:53,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-04 15:44:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716563542] [2025-03-04 15:44:53,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:53,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:53,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:53,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash 468508079, now seen corresponding path program 1 times [2025-03-04 15:44:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145423582] [2025-03-04 15:44:53,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:53,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:53,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:53,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:53,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:53,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,462 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:53,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:53,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:53,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:53,463 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:53,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:53,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:53,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration6_Lasso [2025-03-04 15:44:53,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:53,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:53,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,724 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:53,724 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,726 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) [2025-03-04 15:44:53,727 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 [2025-03-04 15:44:53,728 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 [2025-03-04 15:44:53,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:44:53,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,750 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) [2025-03-04 15:44:53,752 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 [2025-03-04 15:44:53,753 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 [2025-03-04 15:44:53,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,776 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 [2025-03-04 15:44:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,778 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) [2025-03-04 15:44:53,778 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 [2025-03-04 15:44:53,781 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 [2025-03-04 15:44:53,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,797 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 [2025-03-04 15:44:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,800 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) [2025-03-04 15:44:53,801 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 [2025-03-04 15:44:53,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 [2025-03-04 15:44:53,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,820 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 [2025-03-04 15:44:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,822 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) [2025-03-04 15:44:53,823 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 [2025-03-04 15:44:53,824 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 [2025-03-04 15:44:53,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,842 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 [2025-03-04 15:44:53,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,844 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) [2025-03-04 15:44:53,845 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 [2025-03-04 15:44:53,846 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 [2025-03-04 15:44:53,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,862 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 [2025-03-04 15:44:53,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,864 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2025-03-04 15:44:53,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:44:53,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 [2025-03-04 15:44:53,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:44:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,883 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) [2025-03-04 15:44:53,884 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 [2025-03-04 15:44:53,885 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 [2025-03-04 15:44:53,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,901 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 [2025-03-04 15:44:53,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,904 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) [2025-03-04 15:44:53,906 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 [2025-03-04 15:44:53,907 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 [2025-03-04 15:44:53,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,924 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) [2025-03-04 15:44:53,924 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 [2025-03-04 15:44:53,925 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 [2025-03-04 15:44:53,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,948 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 [2025-03-04 15:44:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,950 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) [2025-03-04 15:44:53,951 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 [2025-03-04 15:44:53,952 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 [2025-03-04 15:44:53,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,968 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 [2025-03-04 15:44:53,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,969 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) [2025-03-04 15:44:53,970 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 [2025-03-04 15:44:53,971 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 [2025-03-04 15:44:53,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,988 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 [2025-03-04 15:44:53,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,990 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) [2025-03-04 15:44:53,991 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 [2025-03-04 15:44:53,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 [2025-03-04 15:44:54,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:54,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:54,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:54,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:54,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:54,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:54,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:54,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:54,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:54,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,010 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) [2025-03-04 15:44:54,011 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 [2025-03-04 15:44:54,012 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 [2025-03-04 15:44:54,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:54,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:54,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:54,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:54,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:54,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:54,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:54,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:54,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:44:54,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,029 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) [2025-03-04 15:44:54,029 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 [2025-03-04 15:44:54,030 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 [2025-03-04 15:44:54,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:54,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:54,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:54,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:54,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:54,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:54,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:54,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:54,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,048 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) [2025-03-04 15:44:54,049 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 [2025-03-04 15:44:54,050 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 [2025-03-04 15:44:54,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:54,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:54,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:54,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:54,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:54,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:54,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:54,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,073 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) [2025-03-04 15:44:54,074 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 [2025-03-04 15:44:54,075 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 [2025-03-04 15:44:54,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:54,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:54,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:54,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:54,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:54,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:54,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:54,097 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:54,097 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:44:54,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,099 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) [2025-03-04 15:44:54,100 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 [2025-03-04 15:44:54,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:54,111 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:54,111 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:54,111 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1 Supporting invariants [] [2025-03-04 15:44:54,116 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 [2025-03-04 15:44:54,124 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:44:54,125 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:54,125 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:54,125 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-04 15:44:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:54,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:54,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,181 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 [2025-03-04 15:44:54,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 15:44:54,211 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 33 states and 45 transitions. Complement of second has 8 states. [2025-03-04 15:44:54,212 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 [2025-03-04 15:44:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-04 15:44:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-03-04 15:44:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-04 15:44:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-04 15:44:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-04 15:44:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2025-03-04 15:44:54,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:54,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2025-03-04 15:44:54,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:44:54,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:54,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-03-04 15:44:54,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:54,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:44:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-03-04 15:44:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:44:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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) [2025-03-04 15:44:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-04 15:44:54,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-04 15:44:54,219 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-04 15:44:54,219 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:44:54,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-03-04 15:44:54,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:54,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:54,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:54,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:54,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:54,219 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:54,219 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash -735303045, now seen corresponding path program 2 times [2025-03-04 15:44:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009047409] [2025-03-04 15:44:54,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:44:54,245 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 [2025-03-04 15:44:54,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:44:54,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009047409] [2025-03-04 15:44:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009047409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783097111] [2025-03-04 15:44:54,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,319 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:54,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-04 15:44:54,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:44:54,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:44:54,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:54,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:54,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783097111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:54,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 15:44:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729434824] [2025-03-04 15:44:54,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:54,431 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 2 times [2025-03-04 15:44:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273947920] [2025-03-04 15:44:54,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:54,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:54,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:54,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:54,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:44:54,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:44:54,470 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 14 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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) [2025-03-04 15:44:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:54,510 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-03-04 15:44:54,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2025-03-04 15:44:54,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:54,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2025-03-04 15:44:54,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:44:54,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:54,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-03-04 15:44:54,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:54,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:44:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-03-04 15:44:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 15:44:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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) [2025-03-04 15:44:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-04 15:44:54,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:44:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:44:54,514 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-04 15:44:54,514 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:44:54,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2025-03-04 15:44:54,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:54,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:54,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:54,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:54,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:54,514 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:54,514 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:54,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2100337179, now seen corresponding path program 3 times [2025-03-04 15:44:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038445805] [2025-03-04 15:44:54,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:44:54,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:54,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:44:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:54,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:54,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 3 times [2025-03-04 15:44:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853280056] [2025-03-04 15:44:54,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:54,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:54,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash 210600516, now seen corresponding path program 1 times [2025-03-04 15:44:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745200999] [2025-03-04 15:44:54,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:54,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:54,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,820 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:54,820 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:54,820 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:54,820 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:54,820 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:54,820 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:54,820 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:54,820 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:54,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration8_Lasso [2025-03-04 15:44:54,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:54,820 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:54,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:54,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:55,128 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:55,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,131 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) [2025-03-04 15:44:55,132 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 [2025-03-04 15:44:55,133 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 [2025-03-04 15:44:55,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,151 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 [2025-03-04 15:44:55,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,153 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) [2025-03-04 15:44:55,154 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 [2025-03-04 15:44:55,155 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 [2025-03-04 15:44:55,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,174 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) [2025-03-04 15:44:55,174 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 [2025-03-04 15:44:55,175 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 [2025-03-04 15:44:55,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,191 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 [2025-03-04 15:44:55,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,192 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) [2025-03-04 15:44:55,193 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 [2025-03-04 15:44:55,194 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 [2025-03-04 15:44:55,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:44:55,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,218 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) [2025-03-04 15:44:55,219 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 [2025-03-04 15:44:55,220 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 [2025-03-04 15:44:55,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,235 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 [2025-03-04 15:44:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,236 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) [2025-03-04 15:44:55,237 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 [2025-03-04 15:44:55,238 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 [2025-03-04 15:44:55,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,253 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 [2025-03-04 15:44:55,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,255 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) [2025-03-04 15:44:55,255 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 [2025-03-04 15:44:55,256 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 [2025-03-04 15:44:55,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:55,276 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:55,276 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:44:55,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,278 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2025-03-04 15:44:55,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:44:55,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:55,289 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:55,289 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:55,289 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1 Supporting invariants [] [2025-03-04 15:44:55,294 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 [2025-03-04 15:44:55,305 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 15:44:55,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:55,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:55,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:44:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:55,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:55,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:55,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:55,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:55,441 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 [2025-03-04 15:44:55,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 25 states and 34 transitions. Complement of second has 5 states. [2025-03-04 15:44:55,461 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 [2025-03-04 15:44:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:44:55,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 15:44:55,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:55,462 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:55,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:55,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:55,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:55,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:55,594 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 [2025-03-04 15:44:55,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 25 states and 34 transitions. Complement of second has 5 states. [2025-03-04 15:44:55,614 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 [2025-03-04 15:44:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:44:55,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 15:44:55,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:55,615 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:55,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:55,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:55,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:55,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:55,757 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 [2025-03-04 15:44:55,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 52 states and 68 transitions. Complement of second has 11 states. [2025-03-04 15:44:55,826 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 [2025-03-04 15:44:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2025-03-04 15:44:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2025-03-04 15:44:55,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 15:44:55,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:55,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-04 15:44:55,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:55,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 4 letters. [2025-03-04 15:44:55,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:55,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 68 transitions. [2025-03-04 15:44:55,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 15:44:55,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 63 transitions. [2025-03-04 15:44:55,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:44:55,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-04 15:44:55,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2025-03-04 15:44:55,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:55,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-04 15:44:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2025-03-04 15:44:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2025-03-04 15:44:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 32 states have internal predecessors, (45), 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) [2025-03-04 15:44:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-03-04 15:44:55,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-03-04 15:44:55,830 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-03-04 15:44:55,830 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:44:55,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2025-03-04 15:44:55,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:55,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:55,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:55,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:55,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:55,831 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-04 15:44:55,831 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-04 15:44:55,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash 210600515, now seen corresponding path program 4 times [2025-03-04 15:44:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:55,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32297402] [2025-03-04 15:44:55,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:55,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:44:55,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:55,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:55,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:55,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:55,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:55,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-03-04 15:44:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056271043] [2025-03-04 15:44:55,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:55,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:55,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:55,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:55,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:55,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash 523632226, now seen corresponding path program 1 times [2025-03-04 15:44:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938926295] [2025-03-04 15:44:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:55,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:44:55,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:44:55,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:44:55,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:44:55,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:55,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:56,160 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:56,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:56,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:56,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:56,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:56,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:56,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:56,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration9_Lasso [2025-03-04 15:44:56,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:56,160 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:56,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:56,555 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:56,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,557 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) [2025-03-04 15:44:56,558 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 [2025-03-04 15:44:56,559 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 [2025-03-04 15:44:56,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,575 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 [2025-03-04 15:44:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,577 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) [2025-03-04 15:44:56,578 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 [2025-03-04 15:44:56,578 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 [2025-03-04 15:44:56,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,593 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 [2025-03-04 15:44:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,595 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) [2025-03-04 15:44:56,596 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 [2025-03-04 15:44:56,597 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 [2025-03-04 15:44:56,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,613 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) [2025-03-04 15:44:56,614 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 [2025-03-04 15:44:56,615 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 [2025-03-04 15:44:56,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,630 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 [2025-03-04 15:44:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,632 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) [2025-03-04 15:44:56,633 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 [2025-03-04 15:44:56,633 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 [2025-03-04 15:44:56,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,648 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 [2025-03-04 15:44:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,650 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) [2025-03-04 15:44:56,651 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 [2025-03-04 15:44:56,652 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 [2025-03-04 15:44:56,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,674 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 [2025-03-04 15:44:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,676 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) [2025-03-04 15:44:56,677 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 [2025-03-04 15:44:56,678 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 [2025-03-04 15:44:56,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,695 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) [2025-03-04 15:44:56,695 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 [2025-03-04 15:44:56,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 [2025-03-04 15:44:56,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,712 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 [2025-03-04 15:44:56,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,714 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) [2025-03-04 15:44:56,716 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 [2025-03-04 15:44:56,716 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 [2025-03-04 15:44:56,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,733 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) [2025-03-04 15:44:56,734 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 [2025-03-04 15:44:56,735 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 [2025-03-04 15:44:56,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 15:44:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,751 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) [2025-03-04 15:44:56,752 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 [2025-03-04 15:44:56,753 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 [2025-03-04 15:44:56,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,768 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 [2025-03-04 15:44:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,770 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) [2025-03-04 15:44:56,770 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 [2025-03-04 15:44:56,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 [2025-03-04 15:44:56,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,787 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 [2025-03-04 15:44:56,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,789 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) [2025-03-04 15:44:56,790 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 [2025-03-04 15:44:56,791 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 [2025-03-04 15:44:56,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,810 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) [2025-03-04 15:44:56,811 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 [2025-03-04 15:44:56,813 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 [2025-03-04 15:44:56,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,831 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 [2025-03-04 15:44:56,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,833 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2025-03-04 15:44:56,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 15:44:56,835 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 [2025-03-04 15:44:56,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,854 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) [2025-03-04 15:44:56,855 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 [2025-03-04 15:44:56,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 [2025-03-04 15:44:56,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,875 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) [2025-03-04 15:44:56,876 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 [2025-03-04 15:44:56,877 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 [2025-03-04 15:44:56,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,895 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 [2025-03-04 15:44:56,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,896 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) [2025-03-04 15:44:56,897 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 [2025-03-04 15:44:56,898 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 [2025-03-04 15:44:56,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,913 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 [2025-03-04 15:44:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,914 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) [2025-03-04 15:44:56,915 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 [2025-03-04 15:44:56,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 [2025-03-04 15:44:56,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:56,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,935 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) [2025-03-04 15:44:56,936 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 [2025-03-04 15:44:56,937 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 [2025-03-04 15:44:56,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:56,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:56,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:56,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,952 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 [2025-03-04 15:44:56,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,954 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) [2025-03-04 15:44:56,955 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 [2025-03-04 15:44:56,955 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 [2025-03-04 15:44:56,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:56,978 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 [2025-03-04 15:44:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,979 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) [2025-03-04 15:44:56,980 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 [2025-03-04 15:44:56,981 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 [2025-03-04 15:44:56,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:56,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:56,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:56,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:56,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:56,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:56,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:57,000 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 [2025-03-04 15:44:57,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:57,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:57,002 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) [2025-03-04 15:44:57,003 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 [2025-03-04 15:44:57,003 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 [2025-03-04 15:44:57,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:57,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:57,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:57,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:57,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:57,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:57,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:57,028 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 15:44:57,028 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:44:57,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:57,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:57,030 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) [2025-03-04 15:44:57,031 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 [2025-03-04 15:44:57,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:57,041 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:57,041 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:57,041 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1 Supporting invariants [] [2025-03-04 15:44:57,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:57,054 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 15:44:57,057 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:57,057 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:57,057 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:44:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:57,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:57,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,160 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 [2025-03-04 15:44:57,160 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-04 15:44:57,190 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 47 transitions. Complement of second has 5 states. [2025-03-04 15:44:57,191 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 [2025-03-04 15:44:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:44:57,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-04 15:44:57,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:57,191 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,289 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 [2025-03-04 15:44:57,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 47 transitions. Complement of second has 5 states. [2025-03-04 15:44:57,308 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 [2025-03-04 15:44:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:44:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-04 15:44:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:57,308 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:57,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,406 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 [2025-03-04 15:44:57,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,459 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 46 states and 61 transitions. Complement of second has 11 states. [2025-03-04 15:44:57,460 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 [2025-03-04 15:44:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:44:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-03-04 15:44:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-04 15:44:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-04 15:44:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-04 15:44:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:57,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2025-03-04 15:44:57,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:57,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 48 transitions. [2025-03-04 15:44:57,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:44:57,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:44:57,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2025-03-04 15:44:57,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:57,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-03-04 15:44:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2025-03-04 15:44:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-03-04 15:44:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 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) [2025-03-04 15:44:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-04 15:44:57,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-04 15:44:57,463 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-04 15:44:57,463 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:44:57,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2025-03-04 15:44:57,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:57,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:57,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:57,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:57,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:57,463 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:57,463 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 699394670, now seen corresponding path program 5 times [2025-03-04 15:44:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894623504] [2025-03-04 15:44:57,464 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-04 15:44:57,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:44:57,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 15:44:57,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894623504] [2025-03-04 15:44:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894623504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060851333] [2025-03-04 15:44:57,533 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:57,534 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:57,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-04 15:44:57,572 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-04 15:44:57,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:44:57,581 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 15:44:57,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:57,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:57,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060851333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:57,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 15:44:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806917278] [2025-03-04 15:44:57,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:57,667 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 4 times [2025-03-04 15:44:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112086622] [2025-03-04 15:44:57,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,670 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:44:57,671 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:57,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:44:57,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:44:57,702 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 18 Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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) [2025-03-04 15:44:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:57,751 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2025-03-04 15:44:57,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2025-03-04 15:44:57,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:57,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 33 states and 43 transitions. [2025-03-04 15:44:57,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:44:57,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:57,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2025-03-04 15:44:57,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:57,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-04 15:44:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2025-03-04 15:44:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 15:44:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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) [2025-03-04 15:44:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-04 15:44:57,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-04 15:44:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:44:57,755 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-04 15:44:57,755 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:44:57,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2025-03-04 15:44:57,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:57,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:57,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:57,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:57,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:57,756 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:57,756 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:57,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash 910222276, now seen corresponding path program 6 times [2025-03-04 15:44:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651008028] [2025-03-04 15:44:57,757 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:44:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,761 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-04 15:44:57,777 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:57,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 15:44:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:57,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 5 times [2025-03-04 15:44:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155233987] [2025-03-04 15:44:57,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,792 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:57,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1449720733, now seen corresponding path program 2 times [2025-03-04 15:44:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706740988] [2025-03-04 15:44:57,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:44:57,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:44:57,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:44:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:44:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:58,167 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:58,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:58,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:58,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:58,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:58,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:58,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:58,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration11_Lasso [2025-03-04 15:44:58,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:58,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:58,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:58,477 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,479 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) [2025-03-04 15:44:58,480 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 [2025-03-04 15:44:58,481 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 [2025-03-04 15:44:58,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,501 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) [2025-03-04 15:44:58,501 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 [2025-03-04 15:44:58,502 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 [2025-03-04 15:44:58,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-04 15:44:58,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,519 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) [2025-03-04 15:44:58,520 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 [2025-03-04 15:44:58,521 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 [2025-03-04 15:44:58,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,536 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 [2025-03-04 15:44:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,538 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) [2025-03-04 15:44:58,539 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 [2025-03-04 15:44:58,539 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 [2025-03-04 15:44:58,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,554 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 [2025-03-04 15:44:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,556 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) [2025-03-04 15:44:58,557 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 [2025-03-04 15:44:58,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 [2025-03-04 15:44:58,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-04 15:44:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,577 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) [2025-03-04 15:44:58,578 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 [2025-03-04 15:44:58,579 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 [2025-03-04 15:44:58,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,598 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 [2025-03-04 15:44:58,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,600 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) [2025-03-04 15:44:58,602 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 [2025-03-04 15:44:58,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 [2025-03-04 15:44:58,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:58,623 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:58,623 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:44:58,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,625 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) [2025-03-04 15:44:58,626 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 [2025-03-04 15:44:58,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:58,636 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:58,636 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:58,636 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1 Supporting invariants [] [2025-03-04 15:44:58,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:58,649 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-04 15:44:58,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:58,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:58,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:44:58,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:58,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:58,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:58,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:58,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:58,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:44:58,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:58,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:58,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:58,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:58,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:58,829 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 [2025-03-04 15:44:58,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:58,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) Result 34 states and 45 transitions. Complement of second has 5 states. [2025-03-04 15:44:58,847 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 [2025-03-04 15:44:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:44:58,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-04 15:44:58,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:58,848 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:58,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:58,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:58,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:58,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:58,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:44:58,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:58,943 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 [2025-03-04 15:44:58,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:59,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:59,016 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 [2025-03-04 15:44:59,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:59,039 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) Result 34 states and 45 transitions. Complement of second has 5 states. [2025-03-04 15:44:59,041 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 [2025-03-04 15:44:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:44:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-04 15:44:59,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,042 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:59,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:59,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:59,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:59,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:59,185 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 [2025-03-04 15:44:59,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:59,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) Result 62 states and 81 transitions. Complement of second has 13 states. [2025-03-04 15:44:59,265 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 [2025-03-04 15:44:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2025-03-04 15:44:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2025-03-04 15:44:59,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-04 15:44:59,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 23 letters. Loop has 2 letters. [2025-03-04 15:44:59,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 21 letters. Loop has 4 letters. [2025-03-04 15:44:59,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2025-03-04 15:44:59,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 15:44:59,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2025-03-04 15:44:59,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:44:59,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-04 15:44:59,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2025-03-04 15:44:59,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:59,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 76 transitions. [2025-03-04 15:44:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2025-03-04 15:44:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2025-03-04 15:44:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 41 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) [2025-03-04 15:44:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-04 15:44:59,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-04 15:44:59,268 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-04 15:44:59,268 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:44:59,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2025-03-04 15:44:59,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:59,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:59,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:59,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:59,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:59,269 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-04 15:44:59,269 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-04 15:44:59,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1449720734, now seen corresponding path program 7 times [2025-03-04 15:44:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128454968] [2025-03-04 15:44:59,270 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:44:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:59,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:44:59,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:44:59,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:59,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:44:59,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:44:59,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:59,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 3 times [2025-03-04 15:44:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989076878] [2025-03-04 15:44:59,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:59,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:59,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:59,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:59,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:59,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1612221247, now seen corresponding path program 2 times [2025-03-04 15:44:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526954368] [2025-03-04 15:44:59,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:59,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:44:59,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:44:59,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:59,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:59,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:44:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:44:59,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:59,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:59,699 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:59,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:59,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:59,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:59,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:59,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:59,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:59,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:59,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration12_Lasso [2025-03-04 15:44:59,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:59,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:59,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:59,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:00,076 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:00,077 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,078 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) [2025-03-04 15:45:00,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 [2025-03-04 15:45:00,080 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 [2025-03-04 15:45:00,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,097 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) [2025-03-04 15:45:00,098 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 [2025-03-04 15:45:00,099 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 [2025-03-04 15:45:00,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,114 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 [2025-03-04 15:45:00,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,116 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) [2025-03-04 15:45:00,116 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 [2025-03-04 15:45:00,117 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 [2025-03-04 15:45:00,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,132 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 [2025-03-04 15:45:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,134 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) [2025-03-04 15:45:00,135 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 [2025-03-04 15:45:00,135 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 [2025-03-04 15:45:00,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,151 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 [2025-03-04 15:45:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,152 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) [2025-03-04 15:45:00,153 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 [2025-03-04 15:45:00,154 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 [2025-03-04 15:45:00,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-04 15:45:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,170 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2025-03-04 15:45:00,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-04 15:45:00,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 [2025-03-04 15:45:00,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-04 15:45:00,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,189 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) [2025-03-04 15:45:00,190 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 [2025-03-04 15:45:00,191 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 [2025-03-04 15:45:00,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,208 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 [2025-03-04 15:45:00,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,210 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) [2025-03-04 15:45:00,210 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 [2025-03-04 15:45:00,211 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 [2025-03-04 15:45:00,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,227 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 [2025-03-04 15:45:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,228 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) [2025-03-04 15:45:00,229 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 [2025-03-04 15:45:00,230 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 [2025-03-04 15:45:00,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,247 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) [2025-03-04 15:45:00,247 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 [2025-03-04 15:45:00,248 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 [2025-03-04 15:45:00,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,263 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 [2025-03-04 15:45:00,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,265 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) [2025-03-04 15:45:00,266 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 [2025-03-04 15:45:00,267 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 [2025-03-04 15:45:00,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-04 15:45:00,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,284 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) [2025-03-04 15:45:00,284 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 [2025-03-04 15:45:00,285 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 [2025-03-04 15:45:00,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,300 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 [2025-03-04 15:45:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,302 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) [2025-03-04 15:45:00,303 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 [2025-03-04 15:45:00,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 [2025-03-04 15:45:00,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,322 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 [2025-03-04 15:45:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,323 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) [2025-03-04 15:45:00,324 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 [2025-03-04 15:45:00,325 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 [2025-03-04 15:45:00,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,344 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) [2025-03-04 15:45:00,344 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 [2025-03-04 15:45:00,345 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 [2025-03-04 15:45:00,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,360 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 [2025-03-04 15:45:00,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,362 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) [2025-03-04 15:45:00,362 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 [2025-03-04 15:45:00,363 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 [2025-03-04 15:45:00,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,378 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 [2025-03-04 15:45:00,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,380 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2025-03-04 15:45:00,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-04 15:45:00,382 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 [2025-03-04 15:45:00,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-04 15:45:00,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,400 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) [2025-03-04 15:45:00,401 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 [2025-03-04 15:45:00,402 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 [2025-03-04 15:45:00,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,417 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 [2025-03-04 15:45:00,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,419 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) [2025-03-04 15:45:00,420 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 [2025-03-04 15:45:00,421 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 [2025-03-04 15:45:00,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,436 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 [2025-03-04 15:45:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,437 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) [2025-03-04 15:45:00,438 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 [2025-03-04 15:45:00,439 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 [2025-03-04 15:45:00,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,454 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 [2025-03-04 15:45:00,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,456 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) [2025-03-04 15:45:00,457 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 [2025-03-04 15:45:00,458 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 [2025-03-04 15:45:00,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:00,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:00,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:00,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,474 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 [2025-03-04 15:45:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,475 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) [2025-03-04 15:45:00,476 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 [2025-03-04 15:45:00,477 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 [2025-03-04 15:45:00,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:00,496 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 [2025-03-04 15:45:00,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,498 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) [2025-03-04 15:45:00,499 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 [2025-03-04 15:45:00,500 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 [2025-03-04 15:45:00,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:00,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:00,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:00,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:00,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:00,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:00,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:00,531 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-04 15:45:00,531 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:45:00,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:00,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:00,533 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) [2025-03-04 15:45:00,534 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 [2025-03-04 15:45:00,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:00,545 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:00,545 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:00,545 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2 Supporting invariants [] [2025-03-04 15:45:00,550 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 [2025-03-04 15:45:00,561 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-04 15:45:00,563 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:00,564 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:00,564 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:45:00,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:45:00,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:00,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:00,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:00,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:00,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:00,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:45:00,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:00,717 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 [2025-03-04 15:45:00,717 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:00,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 43 states and 58 transitions. Complement of second has 5 states. [2025-03-04 15:45:00,741 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 [2025-03-04 15:45:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:45:00,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2025-03-04 15:45:00,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:00,742 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:00,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:45:00,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:45:00,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:00,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:00,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:00,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:00,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:00,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:45:00,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:00,920 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 [2025-03-04 15:45:00,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:00,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 43 states and 58 transitions. Complement of second has 5 states. [2025-03-04 15:45:00,942 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 [2025-03-04 15:45:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:45:00,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2025-03-04 15:45:00,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:00,942 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:00,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:45:00,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:45:00,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:00,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:00,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:01,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:01,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:01,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:45:01,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:01,128 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 [2025-03-04 15:45:01,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:01,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 56 states and 74 transitions. Complement of second has 13 states. [2025-03-04 15:45:01,200 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 [2025-03-04 15:45:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-03-04 15:45:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2025-03-04 15:45:01,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 23 letters. Loop has 2 letters. [2025-03-04 15:45:01,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:01,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 25 letters. Loop has 2 letters. [2025-03-04 15:45:01,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:01,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 23 letters. Loop has 4 letters. [2025-03-04 15:45:01,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:01,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 74 transitions. [2025-03-04 15:45:01,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:45:01,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 47 states and 61 transitions. [2025-03-04 15:45:01,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:45:01,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-04 15:45:01,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. [2025-03-04 15:45:01,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:01,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-03-04 15:45:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. [2025-03-04 15:45:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-03-04 15:45:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 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) [2025-03-04 15:45:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-03-04 15:45:01,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-04 15:45:01,204 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-04 15:45:01,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:45:01,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2025-03-04 15:45:01,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:45:01,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:01,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:01,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:45:01,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:01,205 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:01,205 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1138574605, now seen corresponding path program 8 times [2025-03-04 15:45:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877662027] [2025-03-04 15:45:01,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:01,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:45:01,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:45:01,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877662027] [2025-03-04 15:45:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877662027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684531317] [2025-03-04 15:45:01,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:01,301 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-03-04 15:45:01,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:45:01,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:45:01,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:01,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:01,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:45:01,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:01,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:01,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684531317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:01,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 15:45:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127217190] [2025-03-04 15:45:01,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:01,482 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:01,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 6 times [2025-03-04 15:45:01,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:01,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155743715] [2025-03-04 15:45:01,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:01,486 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:01,487 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:01,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:45:01,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,487 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:01,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:01,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:01,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:45:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:45:01,522 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 22 Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 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) [2025-03-04 15:45:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:01,588 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-04 15:45:01,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. [2025-03-04 15:45:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:45:01,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 42 states and 54 transitions. [2025-03-04 15:45:01,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:45:01,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:01,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2025-03-04 15:45:01,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:01,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-03-04 15:45:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2025-03-04 15:45:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 15:45:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 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) [2025-03-04 15:45:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2025-03-04 15:45:01,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-03-04 15:45:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:45:01,592 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-03-04 15:45:01,592 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:45:01,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2025-03-04 15:45:01,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:45:01,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:01,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:01,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:45:01,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:01,593 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:01,593 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash -543736073, now seen corresponding path program 9 times [2025-03-04 15:45:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544950446] [2025-03-04 15:45:01,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:01,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-04 15:45:01,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:45:01,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:45:01,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:01,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:45:01,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:45:01,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 7 times [2025-03-04 15:45:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711571796] [2025-03-04 15:45:01,623 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:01,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:01,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:01,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:01,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:01,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1455644374, now seen corresponding path program 3 times [2025-03-04 15:45:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744234436] [2025-03-04 15:45:01,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:01,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 15:45:01,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:01,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:45:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:45:01,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:01,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:01,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:01,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:02,172 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:02,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:02,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:02,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:02,173 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:02,173 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,173 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:02,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:02,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration14_Lasso [2025-03-04 15:45:02,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:02,173 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:02,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,484 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:02,485 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:02,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,486 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) [2025-03-04 15:45:02,487 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 [2025-03-04 15:45:02,488 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 [2025-03-04 15:45:02,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,503 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 [2025-03-04 15:45:02,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,505 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) [2025-03-04 15:45:02,505 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 [2025-03-04 15:45:02,506 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 [2025-03-04 15:45:02,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,521 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 [2025-03-04 15:45:02,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,523 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) [2025-03-04 15:45:02,524 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 [2025-03-04 15:45:02,525 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 [2025-03-04 15:45:02,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,540 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 [2025-03-04 15:45:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,542 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) [2025-03-04 15:45:02,542 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 [2025-03-04 15:45:02,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 [2025-03-04 15:45:02,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:02,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,562 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) [2025-03-04 15:45:02,563 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 [2025-03-04 15:45:02,564 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 [2025-03-04 15:45:02,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,579 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 [2025-03-04 15:45:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,581 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) [2025-03-04 15:45:02,582 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 [2025-03-04 15:45:02,582 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 [2025-03-04 15:45:02,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,598 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 [2025-03-04 15:45:02,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,599 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) [2025-03-04 15:45:02,601 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 [2025-03-04 15:45:02,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 [2025-03-04 15:45:02,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:02,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,620 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) [2025-03-04 15:45:02,621 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 [2025-03-04 15:45:02,621 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 [2025-03-04 15:45:02,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,637 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 [2025-03-04 15:45:02,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,638 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) [2025-03-04 15:45:02,639 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 [2025-03-04 15:45:02,640 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 [2025-03-04 15:45:02,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,660 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) [2025-03-04 15:45:02,660 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 [2025-03-04 15:45:02,661 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 [2025-03-04 15:45:02,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,679 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 [2025-03-04 15:45:02,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,681 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) [2025-03-04 15:45:02,681 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 [2025-03-04 15:45:02,682 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 [2025-03-04 15:45:02,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,698 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 [2025-03-04 15:45:02,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,700 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) [2025-03-04 15:45:02,700 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 [2025-03-04 15:45:02,701 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 [2025-03-04 15:45:02,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,717 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 [2025-03-04 15:45:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,719 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) [2025-03-04 15:45:02,719 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 [2025-03-04 15:45:02,720 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 [2025-03-04 15:45:02,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,735 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 [2025-03-04 15:45:02,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,737 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) [2025-03-04 15:45:02,737 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 [2025-03-04 15:45:02,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 [2025-03-04 15:45:02,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,753 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 [2025-03-04 15:45:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,755 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) [2025-03-04 15:45:02,755 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 [2025-03-04 15:45:02,756 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 [2025-03-04 15:45:02,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-04 15:45:02,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,775 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) [2025-03-04 15:45:02,776 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 [2025-03-04 15:45:02,777 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 [2025-03-04 15:45:02,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,792 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 [2025-03-04 15:45:02,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,793 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) [2025-03-04 15:45:02,794 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 [2025-03-04 15:45:02,795 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 [2025-03-04 15:45:02,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,812 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 [2025-03-04 15:45:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,814 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) [2025-03-04 15:45:02,814 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 [2025-03-04 15:45:02,815 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 [2025-03-04 15:45:02,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:02,833 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:45:02,833 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-04 15:45:02,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,836 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) [2025-03-04 15:45:02,837 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 [2025-03-04 15:45:02,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:02,847 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:02,848 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:02,848 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1 Supporting invariants [] [2025-03-04 15:45:02,853 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 [2025-03-04 15:45:02,868 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:45:02,869 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:02,869 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:02,869 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-04 15:45:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:02,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:45:02,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:45:02,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:02,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:02,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:02,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:02,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:02,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:03,005 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 [2025-03-04 15:45:03,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 43 states and 56 transitions. Complement of second has 5 states. [2025-03-04 15:45:03,027 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 [2025-03-04 15:45:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:03,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-04 15:45:03,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,028 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:45:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:45:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,111 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 [2025-03-04 15:45:03,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:03,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:03,187 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 [2025-03-04 15:45:03,187 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 43 states and 56 transitions. Complement of second has 5 states. [2025-03-04 15:45:03,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 [2025-03-04 15:45:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:03,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-04 15:45:03,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,206 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:45:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:45:03,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:03,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:03,352 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 [2025-03-04 15:45:03,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 72 states and 94 transitions. Complement of second has 15 states. [2025-03-04 15:45:03,451 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 [2025-03-04 15:45:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-04 15:45:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2025-03-04 15:45:03,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-04 15:45:03,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 30 letters. Loop has 2 letters. [2025-03-04 15:45:03,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 28 letters. Loop has 4 letters. [2025-03-04 15:45:03,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 94 transitions. [2025-03-04 15:45:03,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 15:45:03,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 67 states and 89 transitions. [2025-03-04 15:45:03,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 15:45:03,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-04 15:45:03,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 89 transitions. [2025-03-04 15:45:03,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:03,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-03-04 15:45:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 89 transitions. [2025-03-04 15:45:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2025-03-04 15:45:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 50 states have internal predecessors, (67), 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) [2025-03-04 15:45:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2025-03-04 15:45:03,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-03-04 15:45:03,457 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-03-04 15:45:03,457 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:45:03,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 67 transitions. [2025-03-04 15:45:03,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:45:03,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:03,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:03,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:45:03,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:03,458 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-04 15:45:03,458 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-04 15:45:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1455644373, now seen corresponding path program 10 times [2025-03-04 15:45:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290790501] [2025-03-04 15:45:03,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:03,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:45:03,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:03,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:03,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:45:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:03,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 4 times [2025-03-04 15:45:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461575578] [2025-03-04 15:45:03,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:03,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:03,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:03,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:03,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:03,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:03,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1285095820, now seen corresponding path program 3 times [2025-03-04 15:45:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650815743] [2025-03-04 15:45:03,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:03,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-04 15:45:03,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:45:03,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:45:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:03,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:45:03,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:45:03,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:03,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:04,439 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:04,440 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:04,440 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:04,440 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:04,440 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:04,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:04,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:04,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:04,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration15_Lasso [2025-03-04 15:45:04,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:04,440 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:04,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:04,959 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:04,959 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:04,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:04,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:04,961 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2025-03-04 15:45:04,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-04 15:45:04,963 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 [2025-03-04 15:45:04,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:04,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:04,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:04,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:04,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:04,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:04,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:04,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-04 15:45:04,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:04,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:04,983 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) [2025-03-04 15:45:04,984 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 [2025-03-04 15:45:04,985 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 [2025-03-04 15:45:04,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:04,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:04,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:04,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:04,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:04,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:04,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:04,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:05,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,003 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) [2025-03-04 15:45:05,003 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 [2025-03-04 15:45:05,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 [2025-03-04 15:45:05,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,020 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 [2025-03-04 15:45:05,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,022 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) [2025-03-04 15:45:05,023 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 [2025-03-04 15:45:05,024 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 [2025-03-04 15:45:05,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,041 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 [2025-03-04 15:45:05,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,043 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) [2025-03-04 15:45:05,043 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 [2025-03-04 15:45:05,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 [2025-03-04 15:45:05,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-04 15:45:05,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,062 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) [2025-03-04 15:45:05,062 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 [2025-03-04 15:45:05,063 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 [2025-03-04 15:45:05,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-04 15:45:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,082 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) [2025-03-04 15:45:05,082 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 [2025-03-04 15:45:05,083 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 [2025-03-04 15:45:05,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,099 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 [2025-03-04 15:45:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,101 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) [2025-03-04 15:45:05,102 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 [2025-03-04 15:45:05,103 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 [2025-03-04 15:45:05,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,120 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 [2025-03-04 15:45:05,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,122 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) [2025-03-04 15:45:05,123 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 [2025-03-04 15:45:05,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 [2025-03-04 15:45:05,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,142 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) [2025-03-04 15:45:05,143 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 [2025-03-04 15:45:05,143 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 [2025-03-04 15:45:05,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,159 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 [2025-03-04 15:45:05,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,161 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) [2025-03-04 15:45:05,161 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 [2025-03-04 15:45:05,162 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 [2025-03-04 15:45:05,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,178 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 [2025-03-04 15:45:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,180 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) [2025-03-04 15:45:05,180 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 [2025-03-04 15:45:05,181 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 [2025-03-04 15:45:05,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,197 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 [2025-03-04 15:45:05,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,198 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) [2025-03-04 15:45:05,199 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 [2025-03-04 15:45:05,200 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 [2025-03-04 15:45:05,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-04 15:45:05,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,219 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) [2025-03-04 15:45:05,219 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 [2025-03-04 15:45:05,220 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 [2025-03-04 15:45:05,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-04 15:45:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,238 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2025-03-04 15:45:05,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-04 15:45:05,240 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 [2025-03-04 15:45:05,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-04 15:45:05,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,257 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) [2025-03-04 15:45:05,258 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 [2025-03-04 15:45:05,258 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 [2025-03-04 15:45:05,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,274 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 [2025-03-04 15:45:05,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,276 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) [2025-03-04 15:45:05,277 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 [2025-03-04 15:45:05,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 [2025-03-04 15:45:05,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,293 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 [2025-03-04 15:45:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,296 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) [2025-03-04 15:45:05,296 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 [2025-03-04 15:45:05,297 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 [2025-03-04 15:45:05,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-04 15:45:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,315 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) [2025-03-04 15:45:05,316 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 [2025-03-04 15:45:05,317 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 [2025-03-04 15:45:05,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-04 15:45:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,335 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) [2025-03-04 15:45:05,335 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 [2025-03-04 15:45:05,336 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 [2025-03-04 15:45:05,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:05,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:05,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:05,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-04 15:45:05,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,354 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) [2025-03-04 15:45:05,354 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 [2025-03-04 15:45:05,355 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 [2025-03-04 15:45:05,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,373 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 [2025-03-04 15:45:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,375 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) [2025-03-04 15:45:05,376 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 [2025-03-04 15:45:05,377 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 [2025-03-04 15:45:05,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,401 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 [2025-03-04 15:45:05,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,403 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) [2025-03-04 15:45:05,404 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 [2025-03-04 15:45:05,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 [2025-03-04 15:45:05,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:05,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,429 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) [2025-03-04 15:45:05,429 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 [2025-03-04 15:45:05,431 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 [2025-03-04 15:45:05,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:05,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,455 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) [2025-03-04 15:45:05,456 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 [2025-03-04 15:45:05,457 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 [2025-03-04 15:45:05,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:05,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:05,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:05,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:05,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:05,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:05,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:05,487 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:45:05,487 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:45:05,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:05,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:05,489 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) [2025-03-04 15:45:05,491 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 [2025-03-04 15:45:05,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:05,505 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:05,505 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:05,505 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1 Supporting invariants [] [2025-03-04 15:45:05,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:05,552 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-03-04 15:45:05,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:05,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:05,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-04 15:45:05,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:05,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:45:05,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:05,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:05,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:05,675 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 [2025-03-04 15:45:05,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:45:05,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 55 states and 72 transitions. Complement of second has 10 states. [2025-03-04 15:45:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:45:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2025-03-04 15:45:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 30 letters. Loop has 2 letters. [2025-03-04 15:45:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:05,715 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:45:05,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:05,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:05,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:05,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:05,829 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-04 15:45:05,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 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) [2025-03-04 15:45:05,859 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. 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 54 states and 70 transitions. Complement of second has 9 states. [2025-03-04 15:45:05,859 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 [2025-03-04 15:45:05,860 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) [2025-03-04 15:45:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-04 15:45:05,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 30 letters. Loop has 2 letters. [2025-03-04 15:45:05,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:05,860 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:05,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:45:05,914 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 [2025-03-04 15:45:05,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:45:05,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:05,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:05,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:05,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:05,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:05,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:05,999 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 [2025-03-04 15:45:05,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:45:06,047 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 65 states and 83 transitions. Complement of second has 15 states. [2025-03-04 15:45:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2025-03-04 15:45:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2025-03-04 15:45:06,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 30 letters. Loop has 2 letters. [2025-03-04 15:45:06,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:06,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-04 15:45:06,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:06,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 30 letters. Loop has 4 letters. [2025-03-04 15:45:06,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:06,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 83 transitions. [2025-03-04 15:45:06,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:06,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 60 transitions. [2025-03-04 15:45:06,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:06,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:06,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2025-03-04 15:45:06,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:06,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-04 15:45:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2025-03-04 15:45:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-04 15:45:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 states have internal predecessors, (58), 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) [2025-03-04 15:45:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-04 15:45:06,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-04 15:45:06,051 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-04 15:45:06,051 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:45:06,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2025-03-04 15:45:06,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:06,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:06,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:06,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:45:06,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:06,052 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:06,052 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1973497344, now seen corresponding path program 11 times [2025-03-04 15:45:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142473468] [2025-03-04 15:45:06,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:06,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-03-04 15:45:06,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:45:06,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 15:45:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142473468] [2025-03-04 15:45:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142473468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492465289] [2025-03-04 15:45:06,157 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:06,159 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:06,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-03-04 15:45:06,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-03-04 15:45:06,223 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:45:06,224 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 15:45:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:06,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:45:06,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:06,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492465289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:06,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2025-03-04 15:45:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596209167] [2025-03-04 15:45:06,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:06,372 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:06,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 8 times [2025-03-04 15:45:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869060727] [2025-03-04 15:45:06,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:06,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:06,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:06,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:06,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:06,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:06,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:06,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:06,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:45:06,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:45:06,405 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 22 Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 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) [2025-03-04 15:45:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:06,480 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-03-04 15:45:06,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2025-03-04 15:45:06,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:06,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 47 states and 59 transitions. [2025-03-04 15:45:06,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:06,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:06,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2025-03-04 15:45:06,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:06,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-04 15:45:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2025-03-04 15:45:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 15:45:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 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) [2025-03-04 15:45:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-03-04 15:45:06,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-04 15:45:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:45:06,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-04 15:45:06,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 15:45:06,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2025-03-04 15:45:06,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:06,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:06,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:06,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:45:06,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:06,486 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:06,486 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:06,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -532670250, now seen corresponding path program 12 times [2025-03-04 15:45:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:06,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828037974] [2025-03-04 15:45:06,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:06,491 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 5 equivalence classes. [2025-03-04 15:45:06,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:45:06,522 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 15:45:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:45:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:45:06,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:06,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 9 times [2025-03-04 15:45:06,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:06,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198864837] [2025-03-04 15:45:06,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:06,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:06,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:06,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:06,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:06,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:06,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:06,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:06,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -795001611, now seen corresponding path program 4 times [2025-03-04 15:45:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595420652] [2025-03-04 15:45:06,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:06,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:45:06,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:06,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:06,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:45:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:06,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:06,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:06,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:07,874 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:07,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:07,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:07,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:07,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:07,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:07,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:07,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:07,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration17_Lasso [2025-03-04 15:45:07,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:07,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:07,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,326 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:08,326 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:08,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,328 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) [2025-03-04 15:45:08,329 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 [2025-03-04 15:45:08,330 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 [2025-03-04 15:45:08,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,347 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 [2025-03-04 15:45:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,349 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) [2025-03-04 15:45:08,350 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 [2025-03-04 15:45:08,351 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 [2025-03-04 15:45:08,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,368 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 [2025-03-04 15:45:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,370 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) [2025-03-04 15:45:08,370 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 [2025-03-04 15:45:08,371 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 [2025-03-04 15:45:08,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,387 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 [2025-03-04 15:45:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,389 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) [2025-03-04 15:45:08,389 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 [2025-03-04 15:45:08,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 [2025-03-04 15:45:08,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,406 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 [2025-03-04 15:45:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,408 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) [2025-03-04 15:45:08,409 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 [2025-03-04 15:45:08,410 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 [2025-03-04 15:45:08,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,427 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 [2025-03-04 15:45:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,429 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) [2025-03-04 15:45:08,430 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 [2025-03-04 15:45:08,431 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 [2025-03-04 15:45:08,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-04 15:45:08,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,451 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) [2025-03-04 15:45:08,452 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 [2025-03-04 15:45:08,452 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 [2025-03-04 15:45:08,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-04 15:45:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,470 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) [2025-03-04 15:45:08,470 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 [2025-03-04 15:45:08,472 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 [2025-03-04 15:45:08,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,488 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 [2025-03-04 15:45:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,490 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) [2025-03-04 15:45:08,490 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 [2025-03-04 15:45:08,491 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 [2025-03-04 15:45:08,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,507 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 [2025-03-04 15:45:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,508 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) [2025-03-04 15:45:08,509 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 [2025-03-04 15:45:08,510 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 [2025-03-04 15:45:08,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,531 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 [2025-03-04 15:45:08,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,533 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) [2025-03-04 15:45:08,535 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 [2025-03-04 15:45:08,536 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 [2025-03-04 15:45:08,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,555 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) [2025-03-04 15:45:08,555 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 [2025-03-04 15:45:08,556 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 [2025-03-04 15:45:08,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,575 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 [2025-03-04 15:45:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,577 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) [2025-03-04 15:45:08,578 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 [2025-03-04 15:45:08,579 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 [2025-03-04 15:45:08,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,599 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 [2025-03-04 15:45:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,601 INFO L229 MonitoredProcess]: Starting monitored process 181 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) [2025-03-04 15:45:08,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-04 15:45:08,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 [2025-03-04 15:45:08,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-04 15:45:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,623 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) [2025-03-04 15:45:08,624 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 [2025-03-04 15:45:08,624 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 [2025-03-04 15:45:08,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,644 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 [2025-03-04 15:45:08,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,646 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) [2025-03-04 15:45:08,646 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 [2025-03-04 15:45:08,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 [2025-03-04 15:45:08,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,662 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:08,667 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:45:08,667 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:45:08,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,669 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) [2025-03-04 15:45:08,669 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 [2025-03-04 15:45:08,670 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:08,680 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:08,680 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:08,680 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1 Supporting invariants [] [2025-03-04 15:45:08,685 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 [2025-03-04 15:45:08,702 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 15:45:08,705 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:08,705 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:08,705 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:08,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:08,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:45:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:45:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:08,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:08,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:08,883 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-04 15:45:08,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:08,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 48 states and 61 transitions. Complement of second has 5 states. [2025-03-04 15:45:08,901 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 [2025-03-04 15:45:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:08,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 35 letters. Loop has 2 letters. [2025-03-04 15:45:08,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:08,902 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:08,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:45:08,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:45:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:09,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:09,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,084 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-04 15:45:09,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:09,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 48 states and 61 transitions. Complement of second has 5 states. [2025-03-04 15:45:09,112 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 [2025-03-04 15:45:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:09,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 35 letters. Loop has 2 letters. [2025-03-04 15:45:09,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,113 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:09,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:45:09,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:45:09,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:09,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:09,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,306 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-04 15:45:09,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:09,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 78 states and 100 transitions. Complement of second has 17 states. [2025-03-04 15:45:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-04 15:45:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 15:45:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2025-03-04 15:45:09,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 35 letters. Loop has 2 letters. [2025-03-04 15:45:09,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-04 15:45:09,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 35 letters. Loop has 4 letters. [2025-03-04 15:45:09,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 100 transitions. [2025-03-04 15:45:09,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:09,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 70 states and 90 transitions. [2025-03-04 15:45:09,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:09,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:09,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2025-03-04 15:45:09,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:09,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-03-04 15:45:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2025-03-04 15:45:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-03-04 15:45:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 54 states have internal predecessors, (69), 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) [2025-03-04 15:45:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-04 15:45:09,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-04 15:45:09,430 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-04 15:45:09,430 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 15:45:09,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. [2025-03-04 15:45:09,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:09,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:09,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:09,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 15:45:09,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:09,431 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:09,431 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1794055009, now seen corresponding path program 13 times [2025-03-04 15:45:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375239068] [2025-03-04 15:45:09,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:09,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:45:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:45:09,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375239068] [2025-03-04 15:45:09,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375239068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785432995] [2025-03-04 15:45:09,579 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:09,581 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:09,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-03-04 15:45:09,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:45:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:45:09,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785432995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:09,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:09,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-04 15:45:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515789203] [2025-03-04 15:45:09,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:09,870 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 10 times [2025-03-04 15:45:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942111499] [2025-03-04 15:45:09,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:09,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:09,873 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:09,873 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:09,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:09,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:09,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:09,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:09,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:09,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:45:09,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:45:09,906 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. cyclomatic complexity: 26 Second operand has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 22 states have internal predecessors, (82), 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) [2025-03-04 15:45:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:10,020 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2025-03-04 15:45:10,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2025-03-04 15:45:10,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:10,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 56 states and 70 transitions. [2025-03-04 15:45:10,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:10,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:10,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2025-03-04 15:45:10,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:10,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-03-04 15:45:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2025-03-04 15:45:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 15:45:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 55 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) [2025-03-04 15:45:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-03-04 15:45:10,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-03-04 15:45:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:45:10,023 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-03-04 15:45:10,023 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-04 15:45:10,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2025-03-04 15:45:10,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:10,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:10,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:10,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 15:45:10,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:10,024 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:10,024 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1173503241, now seen corresponding path program 14 times [2025-03-04 15:45:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818252791] [2025-03-04 15:45:10,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:45:10,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:10,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:10,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:10,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:10,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 11 times [2025-03-04 15:45:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609019678] [2025-03-04 15:45:10,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:10,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:10,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1839783832, now seen corresponding path program 5 times [2025-03-04 15:45:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089718541] [2025-03-04 15:45:10,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 6 equivalence classes. [2025-03-04 15:45:10,083 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:45:10,084 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 15:45:10,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:45:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:45:10,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:12,328 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:12,328 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:12,328 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:12,329 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:12,329 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:12,329 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:12,329 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:12,329 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:12,329 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration19_Lasso [2025-03-04 15:45:12,329 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:12,329 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:12,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:12,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,005 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:13,005 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,007 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) [2025-03-04 15:45:13,008 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 [2025-03-04 15:45:13,009 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 [2025-03-04 15:45:13,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:13,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:13,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:13,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,025 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 [2025-03-04 15:45:13,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,026 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) [2025-03-04 15:45:13,027 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 [2025-03-04 15:45:13,028 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 [2025-03-04 15:45:13,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,054 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 [2025-03-04 15:45:13,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,056 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) [2025-03-04 15:45:13,057 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 [2025-03-04 15:45:13,057 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 [2025-03-04 15:45:13,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:13,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:13,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:13,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,073 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 [2025-03-04 15:45:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,075 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) [2025-03-04 15:45:13,076 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 [2025-03-04 15:45:13,077 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 [2025-03-04 15:45:13,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:13,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:13,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:13,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,093 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 [2025-03-04 15:45:13,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,095 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) [2025-03-04 15:45:13,096 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 [2025-03-04 15:45:13,097 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 [2025-03-04 15:45:13,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:13,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:13,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:13,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-04 15:45:13,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,114 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) [2025-03-04 15:45:13,115 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 [2025-03-04 15:45:13,116 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 [2025-03-04 15:45:13,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,133 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 [2025-03-04 15:45:13,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,136 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) [2025-03-04 15:45:13,138 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 [2025-03-04 15:45:13,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 [2025-03-04 15:45:13,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,159 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 [2025-03-04 15:45:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,161 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) [2025-03-04 15:45:13,162 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 [2025-03-04 15:45:13,163 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 [2025-03-04 15:45:13,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,184 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 [2025-03-04 15:45:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,185 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) [2025-03-04 15:45:13,187 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 [2025-03-04 15:45:13,188 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 [2025-03-04 15:45:13,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:13,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,211 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) [2025-03-04 15:45:13,212 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 [2025-03-04 15:45:13,212 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 [2025-03-04 15:45:13,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,232 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 [2025-03-04 15:45:13,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,234 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) [2025-03-04 15:45:13,234 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 [2025-03-04 15:45:13,235 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 [2025-03-04 15:45:13,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,255 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 [2025-03-04 15:45:13,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,257 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) [2025-03-04 15:45:13,258 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 [2025-03-04 15:45:13,259 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 [2025-03-04 15:45:13,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:13,278 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 [2025-03-04 15:45:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,280 INFO L229 MonitoredProcess]: Starting monitored process 198 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) [2025-03-04 15:45:13,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-04 15:45:13,281 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 [2025-03-04 15:45:13,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:13,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:13,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:13,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:13,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:13,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:13,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:13,302 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 15:45:13,302 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:45:13,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:13,304 INFO L229 MonitoredProcess]: Starting monitored process 199 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) [2025-03-04 15:45:13,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-03-04 15:45:13,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:13,315 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:13,316 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:13,316 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1 Supporting invariants [] [2025-03-04 15:45:13,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-03-04 15:45:13,349 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-03-04 15:45:13,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:13,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:13,352 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:13,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:13,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:13,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:13,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:45:13,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:13,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:13,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:13,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:13,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:13,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:13,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:13,540 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 [2025-03-04 15:45:13,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:13,563 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 57 states and 72 transitions. Complement of second has 5 states. [2025-03-04 15:45:13,563 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 [2025-03-04 15:45:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:13,563 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:13,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:13,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:13,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:13,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:13,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:45:13,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:13,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:13,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:13,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:13,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:13,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:13,780 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 [2025-03-04 15:45:13,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:13,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 57 states and 72 transitions. Complement of second has 5 states. [2025-03-04 15:45:13,802 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 [2025-03-04 15:45:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:13,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:13,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:13,803 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:13,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:13,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:13,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:13,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:13,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:45:13,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:13,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:14,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:14,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:14,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:14,024 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 [2025-03-04 15:45:14,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:14,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 88 states and 113 transitions. Complement of second has 19 states. [2025-03-04 15:45:14,174 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 [2025-03-04 15:45:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-03-04 15:45:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2025-03-04 15:45:14,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:14,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:14,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 44 letters. Loop has 2 letters. [2025-03-04 15:45:14,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:14,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 42 letters. Loop has 4 letters. [2025-03-04 15:45:14,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:14,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 113 transitions. [2025-03-04 15:45:14,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:14,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 80 states and 103 transitions. [2025-03-04 15:45:14,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:14,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:14,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 103 transitions. [2025-03-04 15:45:14,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:14,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-03-04 15:45:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 103 transitions. [2025-03-04 15:45:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-03-04 15:45:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.25) internal successors, (80), 63 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) [2025-03-04 15:45:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 15:45:14,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 15:45:14,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 15:45:14,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-04 15:45:14,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2025-03-04 15:45:14,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:14,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:14,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:14,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 15:45:14,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:14,178 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:14,180 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1467340434, now seen corresponding path program 15 times [2025-03-04 15:45:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183647503] [2025-03-04 15:45:14,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:14,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-03-04 15:45:14,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:45:14,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:45:14,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183647503] [2025-03-04 15:45:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183647503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414839537] [2025-03-04 15:45:14,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,383 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:14,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-03-04 15:45:14,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-03-04 15:45:14,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:45:14,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:45:14,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:14,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:45:14,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:14,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:14,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414839537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:14,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:14,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-03-04 15:45:14,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026485809] [2025-03-04 15:45:14,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:14,724 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:14,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 12 times [2025-03-04 15:45:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881383121] [2025-03-04 15:45:14,724 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:14,727 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:14,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:14,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:45:14,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:14,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:14,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:14,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:14,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:45:14,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-04 15:45:14,759 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. cyclomatic complexity: 30 Second operand has 25 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 25 states have internal predecessors, (95), 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) [2025-03-04 15:45:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:14,896 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2025-03-04 15:45:14,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 142 transitions. [2025-03-04 15:45:14,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:14,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 65 states and 81 transitions. [2025-03-04 15:45:14,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:14,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:14,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2025-03-04 15:45:14,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:14,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-04 15:45:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2025-03-04 15:45:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 15:45:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 64 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) [2025-03-04 15:45:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-04 15:45:14,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-04 15:45:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:45:14,904 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-04 15:45:14,904 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-04 15:45:14,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2025-03-04 15:45:14,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:14,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:14,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:14,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 15:45:14,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:14,905 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:14,905 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2111958296, now seen corresponding path program 16 times [2025-03-04 15:45:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413054742] [2025-03-04 15:45:14,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:14,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 15:45:14,922 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:14,922 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:14,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:45:14,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:14,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 13 times [2025-03-04 15:45:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541587356] [2025-03-04 15:45:14,932 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:14,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:14,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:14,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:14,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1927608967, now seen corresponding path program 6 times [2025-03-04 15:45:14,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:14,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582271101] [2025-03-04 15:45:14,941 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:14,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:14,946 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 7 equivalence classes. [2025-03-04 15:45:14,959 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:45:14,959 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 15:45:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:14,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:45:14,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:45:14,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:14,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:14,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:18,791 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:18,791 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:18,791 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:18,791 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:18,791 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:18,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:18,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:18,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:18,791 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration21_Lasso [2025-03-04 15:45:18,791 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:18,791 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:18,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:18,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:19,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:19,774 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:19,774 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,776 INFO L229 MonitoredProcess]: Starting monitored process 201 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) [2025-03-04 15:45:19,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-04 15:45:19,778 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 [2025-03-04 15:45:19,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:19,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,796 INFO L229 MonitoredProcess]: Starting monitored process 202 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) [2025-03-04 15:45:19,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-04 15:45:19,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 [2025-03-04 15:45:19,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,815 INFO L229 MonitoredProcess]: Starting monitored process 203 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) [2025-03-04 15:45:19,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-04 15:45:19,817 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 [2025-03-04 15:45:19,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:19,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:19,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-04 15:45:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,836 INFO L229 MonitoredProcess]: Starting monitored process 204 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) [2025-03-04 15:45:19,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-04 15:45:19,839 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 [2025-03-04 15:45:19,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:19,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:19,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-03-04 15:45:19,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,862 INFO L229 MonitoredProcess]: Starting monitored process 205 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) [2025-03-04 15:45:19,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-04 15:45:19,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 [2025-03-04 15:45:19,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-04 15:45:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,881 INFO L229 MonitoredProcess]: Starting monitored process 206 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) [2025-03-04 15:45:19,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-04 15:45:19,882 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 [2025-03-04 15:45:19,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-04 15:45:19,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,900 INFO L229 MonitoredProcess]: Starting monitored process 207 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) [2025-03-04 15:45:19,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-04 15:45:19,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 [2025-03-04 15:45:19,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-04 15:45:19,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,919 INFO L229 MonitoredProcess]: Starting monitored process 208 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) [2025-03-04 15:45:19,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-04 15:45:19,920 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 [2025-03-04 15:45:19,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-04 15:45:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,938 INFO L229 MonitoredProcess]: Starting monitored process 209 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) [2025-03-04 15:45:19,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-04 15:45:19,940 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 [2025-03-04 15:45:19,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:19,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:19,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-03-04 15:45:19,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,961 INFO L229 MonitoredProcess]: Starting monitored process 210 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) [2025-03-04 15:45:19,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-04 15:45:19,962 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 [2025-03-04 15:45:19,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-04 15:45:19,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,979 INFO L229 MonitoredProcess]: Starting monitored process 211 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) [2025-03-04 15:45:19,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-04 15:45:19,981 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 [2025-03-04 15:45:19,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:19,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:19,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:19,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:19,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:19,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:19,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:19,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:19,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-03-04 15:45:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:19,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:19,999 INFO L229 MonitoredProcess]: Starting monitored process 212 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) [2025-03-04 15:45:20,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-04 15:45:20,001 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 [2025-03-04 15:45:20,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-04 15:45:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,018 INFO L229 MonitoredProcess]: Starting monitored process 213 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) [2025-03-04 15:45:20,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-03-04 15:45:20,020 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 [2025-03-04 15:45:20,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-03-04 15:45:20,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,043 INFO L229 MonitoredProcess]: Starting monitored process 214 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) [2025-03-04 15:45:20,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-03-04 15:45:20,045 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 [2025-03-04 15:45:20,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,063 INFO L229 MonitoredProcess]: Starting monitored process 215 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) [2025-03-04 15:45:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-03-04 15:45:20,064 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 [2025-03-04 15:45:20,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,082 INFO L229 MonitoredProcess]: Starting monitored process 216 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) [2025-03-04 15:45:20,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-03-04 15:45:20,083 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 [2025-03-04 15:45:20,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,100 INFO L229 MonitoredProcess]: Starting monitored process 217 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) [2025-03-04 15:45:20,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-03-04 15:45:20,102 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 [2025-03-04 15:45:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,119 INFO L229 MonitoredProcess]: Starting monitored process 218 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) [2025-03-04 15:45:20,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-03-04 15:45:20,120 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 [2025-03-04 15:45:20,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-03-04 15:45:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,138 INFO L229 MonitoredProcess]: Starting monitored process 219 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) [2025-03-04 15:45:20,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-03-04 15:45:20,139 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 [2025-03-04 15:45:20,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2025-03-04 15:45:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,157 INFO L229 MonitoredProcess]: Starting monitored process 220 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) [2025-03-04 15:45:20,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-03-04 15:45:20,158 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 [2025-03-04 15:45:20,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2025-03-04 15:45:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,177 INFO L229 MonitoredProcess]: Starting monitored process 221 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) [2025-03-04 15:45:20,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-03-04 15:45:20,179 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 [2025-03-04 15:45:20,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,196 INFO L229 MonitoredProcess]: Starting monitored process 222 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) [2025-03-04 15:45:20,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-03-04 15:45:20,197 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 [2025-03-04 15:45:20,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:20,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:20,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:20,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2025-03-04 15:45:20,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,215 INFO L229 MonitoredProcess]: Starting monitored process 223 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) [2025-03-04 15:45:20,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-03-04 15:45:20,217 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 [2025-03-04 15:45:20,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,240 INFO L229 MonitoredProcess]: Starting monitored process 224 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) [2025-03-04 15:45:20,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-03-04 15:45:20,241 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 [2025-03-04 15:45:20,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-03-04 15:45:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,262 INFO L229 MonitoredProcess]: Starting monitored process 225 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) [2025-03-04 15:45:20,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-03-04 15:45:20,264 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 [2025-03-04 15:45:20,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2025-03-04 15:45:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,286 INFO L229 MonitoredProcess]: Starting monitored process 226 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) [2025-03-04 15:45:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-03-04 15:45:20,287 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 [2025-03-04 15:45:20,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2025-03-04 15:45:20,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,309 INFO L229 MonitoredProcess]: Starting monitored process 227 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) [2025-03-04 15:45:20,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-03-04 15:45:20,310 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 [2025-03-04 15:45:20,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2025-03-04 15:45:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,331 INFO L229 MonitoredProcess]: Starting monitored process 228 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) [2025-03-04 15:45:20,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2025-03-04 15:45:20,333 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 [2025-03-04 15:45:20,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:20,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,354 INFO L229 MonitoredProcess]: Starting monitored process 229 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) [2025-03-04 15:45:20,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2025-03-04 15:45:20,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 [2025-03-04 15:45:20,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:20,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:20,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:20,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:20,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:20,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:20,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:20,376 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:45:20,376 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:45:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:20,378 INFO L229 MonitoredProcess]: Starting monitored process 230 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) [2025-03-04 15:45:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2025-03-04 15:45:20,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:20,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:20,389 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:20,389 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1 Supporting invariants [] [2025-03-04 15:45:20,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:20,430 INFO L156 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2025-03-04 15:45:20,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:20,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:20,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:20,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:45:20,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:20,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:20,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:20,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2025-03-04 15:45:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:20,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:20,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:20,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:20,688 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-04 15:45:20,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:20,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 66 states and 83 transitions. Complement of second has 5 states. [2025-03-04 15:45:20,709 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 [2025-03-04 15:45:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:20,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 49 letters. Loop has 2 letters. [2025-03-04 15:45:20,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:20,709 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:20,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:20,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:45:20,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:20,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:20,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:20,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:20,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:20,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:20,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:20,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:20,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:20,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:20,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:20,931 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-04 15:45:20,931 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:20,952 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 66 states and 83 transitions. Complement of second has 5 states. [2025-03-04 15:45:20,952 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 [2025-03-04 15:45:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:20,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 49 letters. Loop has 2 letters. [2025-03-04 15:45:20,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:20,953 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:20,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:20,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:45:20,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:20,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:20,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:20,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:20,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:21,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:21,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:21,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:21,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:21,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:21,199 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-04 15:45:21,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:21,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 126 transitions. Complement of second has 21 states. [2025-03-04 15:45:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-04 15:45:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2025-03-04 15:45:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2025-03-04 15:45:21,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 49 letters. Loop has 2 letters. [2025-03-04 15:45:21,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:21,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 51 letters. Loop has 2 letters. [2025-03-04 15:45:21,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:21,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 49 letters. Loop has 4 letters. [2025-03-04 15:45:21,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:21,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 126 transitions. [2025-03-04 15:45:21,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:21,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 90 states and 116 transitions. [2025-03-04 15:45:21,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:21,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:21,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 116 transitions. [2025-03-04 15:45:21,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:21,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 116 transitions. [2025-03-04 15:45:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 116 transitions. [2025-03-04 15:45:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2025-03-04 15:45:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 72 states have internal predecessors, (91), 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) [2025-03-04 15:45:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-04 15:45:21,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-04 15:45:21,376 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-04 15:45:21,376 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-04 15:45:21,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 91 transitions. [2025-03-04 15:45:21,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:21,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:21,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:21,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 15:45:21,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:21,377 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:21,380 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:21,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 725322033, now seen corresponding path program 17 times [2025-03-04 15:45:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312436889] [2025-03-04 15:45:21,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:21,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 8 equivalence classes. [2025-03-04 15:45:21,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:45:21,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 15:45:21,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312436889] [2025-03-04 15:45:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312436889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280807756] [2025-03-04 15:45:21,592 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:21,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:21,594 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:21,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Waiting until timeout for monitored process [2025-03-04 15:45:21,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 8 equivalence classes. [2025-03-04 15:45:21,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:45:21,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 15:45:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:21,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:45:21,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:21,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280807756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:21,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2025-03-04 15:45:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104159354] [2025-03-04 15:45:21,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:21,969 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 14 times [2025-03-04 15:45:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755404271] [2025-03-04 15:45:21,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:21,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:21,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:21,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:21,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:21,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:21,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:21,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:21,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:21,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:45:22,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:45:22,008 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. cyclomatic complexity: 34 Second operand has 26 states, 25 states have (on average 3.96) internal successors, (99), 26 states have internal predecessors, (99), 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) [2025-03-04 15:45:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:22,108 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2025-03-04 15:45:22,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 163 transitions. [2025-03-04 15:45:22,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:22,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 74 states and 92 transitions. [2025-03-04 15:45:22,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:22,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:22,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2025-03-04 15:45:22,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:22,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 15:45:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2025-03-04 15:45:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 15:45:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 73 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) [2025-03-04 15:45:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-03-04 15:45:22,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 15:45:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:45:22,111 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 15:45:22,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-04 15:45:22,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 92 transitions. [2025-03-04 15:45:22,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:22,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:22,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:22,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 15:45:22,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:22,111 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:22,112 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:22,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -541269989, now seen corresponding path program 18 times [2025-03-04 15:45:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581106842] [2025-03-04 15:45:22,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:22,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 8 equivalence classes. [2025-03-04 15:45:22,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:22,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 15:45:22,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:22,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:22,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:22,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:22,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 15 times [2025-03-04 15:45:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084753090] [2025-03-04 15:45:22,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:22,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:22,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:22,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:22,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:22,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:22,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:22,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -469416198, now seen corresponding path program 7 times [2025-03-04 15:45:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926852134] [2025-03-04 15:45:22,158 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:22,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:45:22,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:45:22,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:22,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:45:22,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:45:22,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:22,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:22,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,243 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:25,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:25,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:25,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:25,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:25,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:25,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:25,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration23_Lasso [2025-03-04 15:45:25,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:25,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:25,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:25,853 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:25,853 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,856 INFO L229 MonitoredProcess]: Starting monitored process 232 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) [2025-03-04 15:45:25,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2025-03-04 15:45:25,857 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 [2025-03-04 15:45:25,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,874 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Exception during sending of exit command (exit): Broken pipe [2025-03-04 15:45:25,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2025-03-04 15:45:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,876 INFO L229 MonitoredProcess]: Starting monitored process 233 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) [2025-03-04 15:45:25,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2025-03-04 15:45:25,878 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 [2025-03-04 15:45:25,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,896 INFO L229 MonitoredProcess]: Starting monitored process 234 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) [2025-03-04 15:45:25,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2025-03-04 15:45:25,898 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 [2025-03-04 15:45:25,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Ended with exit code 0 [2025-03-04 15:45:25,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,915 INFO L229 MonitoredProcess]: Starting monitored process 235 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) [2025-03-04 15:45:25,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2025-03-04 15:45:25,917 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 [2025-03-04 15:45:25,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2025-03-04 15:45:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,934 INFO L229 MonitoredProcess]: Starting monitored process 236 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) [2025-03-04 15:45:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2025-03-04 15:45:25,936 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 [2025-03-04 15:45:25,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2025-03-04 15:45:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,953 INFO L229 MonitoredProcess]: Starting monitored process 237 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) [2025-03-04 15:45:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2025-03-04 15:45:25,955 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 [2025-03-04 15:45:25,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:25,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,974 INFO L229 MonitoredProcess]: Starting monitored process 238 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) [2025-03-04 15:45:25,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2025-03-04 15:45:25,975 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 [2025-03-04 15:45:25,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:25,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:25,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:25,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:25,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:25,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:25,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:25,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:25,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2025-03-04 15:45:25,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:25,993 INFO L229 MonitoredProcess]: Starting monitored process 239 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) [2025-03-04 15:45:25,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2025-03-04 15:45:25,994 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 [2025-03-04 15:45:26,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:26,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,011 INFO L229 MonitoredProcess]: Starting monitored process 240 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) [2025-03-04 15:45:26,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2025-03-04 15:45:26,013 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 [2025-03-04 15:45:26,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:26,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,031 INFO L229 MonitoredProcess]: Starting monitored process 241 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) [2025-03-04 15:45:26,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2025-03-04 15:45:26,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 [2025-03-04 15:45:26,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:26,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:26,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:26,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2025-03-04 15:45:26,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,050 INFO L229 MonitoredProcess]: Starting monitored process 242 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) [2025-03-04 15:45:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2025-03-04 15:45:26,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 [2025-03-04 15:45:26,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2025-03-04 15:45:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,074 INFO L229 MonitoredProcess]: Starting monitored process 243 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) [2025-03-04 15:45:26,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2025-03-04 15:45:26,076 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 [2025-03-04 15:45:26,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2025-03-04 15:45:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,100 INFO L229 MonitoredProcess]: Starting monitored process 244 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) [2025-03-04 15:45:26,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2025-03-04 15:45:26,102 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 [2025-03-04 15:45:26,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:26,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2025-03-04 15:45:26,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,123 INFO L229 MonitoredProcess]: Starting monitored process 245 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) [2025-03-04 15:45:26,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2025-03-04 15:45:26,125 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 [2025-03-04 15:45:26,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:26,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:26,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:26,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:26,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:26,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:26,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:26,145 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:45:26,145 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:45:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:26,147 INFO L229 MonitoredProcess]: Starting monitored process 246 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) [2025-03-04 15:45:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2025-03-04 15:45:26,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:26,158 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:26,158 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:26,158 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1 Supporting invariants [] [2025-03-04 15:45:26,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:26,179 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-03-04 15:45:26,181 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:26,181 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:26,181 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:26,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:26,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:26,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:26,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:26,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2025-03-04 15:45:26,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:26,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:26,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:26,462 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 [2025-03-04 15:45:26,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:26,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 75 states and 94 transitions. Complement of second has 5 states. [2025-03-04 15:45:26,484 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 [2025-03-04 15:45:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-04 15:45:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:26,485 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:26,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:26,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:26,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:26,733 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 [2025-03-04 15:45:26,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:26,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 75 states and 94 transitions. Complement of second has 5 states. [2025-03-04 15:45:26,756 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 [2025-03-04 15:45:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:26,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-04 15:45:26,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:26,757 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:26,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:26,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:26,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:45:26,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:27,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:27,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:27,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:27,024 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 [2025-03-04 15:45:27,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:27,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 108 states and 139 transitions. Complement of second has 23 states. [2025-03-04 15:45:27,227 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 [2025-03-04 15:45:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2025-03-04 15:45:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2025-03-04 15:45:27,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 56 letters. Loop has 2 letters. [2025-03-04 15:45:27,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 58 letters. Loop has 2 letters. [2025-03-04 15:45:27,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 56 letters. Loop has 4 letters. [2025-03-04 15:45:27,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:27,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 139 transitions. [2025-03-04 15:45:27,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:27,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 100 states and 129 transitions. [2025-03-04 15:45:27,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:27,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:27,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 129 transitions. [2025-03-04 15:45:27,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:27,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 129 transitions. [2025-03-04 15:45:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 129 transitions. [2025-03-04 15:45:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2025-03-04 15:45:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 81 states have internal predecessors, (102), 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) [2025-03-04 15:45:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2025-03-04 15:45:27,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-03-04 15:45:27,230 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-03-04 15:45:27,230 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-04 15:45:27,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 102 transitions. [2025-03-04 15:45:27,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:27,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:27,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:27,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-04 15:45:27,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:27,231 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:27,231 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:27,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1101685796, now seen corresponding path program 19 times [2025-03-04 15:45:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016460279] [2025-03-04 15:45:27,232 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:45:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:45:27,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 133 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016460279] [2025-03-04 15:45:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016460279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725740537] [2025-03-04 15:45:27,474 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:27,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:27,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:27,476 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (247)] Waiting until timeout for monitored process [2025-03-04 15:45:27,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:45:27,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:45:27,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:27,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:27,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:27,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:27,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725740537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:28,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-03-04 15:45:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139736520] [2025-03-04 15:45:28,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:28,000 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 16 times [2025-03-04 15:45:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954737021] [2025-03-04 15:45:28,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:28,003 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:28,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:28,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:28,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:28,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:28,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:28,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:28,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 15:45:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-03-04 15:45:28,044 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. cyclomatic complexity: 38 Second operand has 31 states, 30 states have (on average 4.033333333333333) internal successors, (121), 31 states have internal predecessors, (121), 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) [2025-03-04 15:45:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:28,186 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2025-03-04 15:45:28,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 184 transitions. [2025-03-04 15:45:28,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:28,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 83 states and 103 transitions. [2025-03-04 15:45:28,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:28,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:28,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 103 transitions. [2025-03-04 15:45:28,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:28,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-04 15:45:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 103 transitions. [2025-03-04 15:45:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 15:45:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 82 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) [2025-03-04 15:45:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-03-04 15:45:28,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-04 15:45:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:45:28,189 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-03-04 15:45:28,190 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-04 15:45:28,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 103 transitions. [2025-03-04 15:45:28,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:28,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:28,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:28,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-04 15:45:28,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:28,190 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:28,191 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:28,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1122980346, now seen corresponding path program 20 times [2025-03-04 15:45:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223725859] [2025-03-04 15:45:28,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:28,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 15:45:28,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 15:45:28,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:28,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 15:45:28,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 15:45:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 17 times [2025-03-04 15:45:28,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:28,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161407464] [2025-03-04 15:45:28,221 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:28,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:28,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:28,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:28,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:28,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:28,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:28,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:28,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1147321625, now seen corresponding path program 8 times [2025-03-04 15:45:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472100530] [2025-03-04 15:45:28,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:28,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-04 15:45:28,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:45:28,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:28,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:28,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:45:28,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:45:28,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:28,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:28,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:32,463 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:32,463 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:32,463 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:32,463 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:32,463 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:32,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:32,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:32,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:32,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration25_Lasso [2025-03-04 15:45:32,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:32,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:32,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:32,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:33,138 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:33,138 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:33,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,141 INFO L229 MonitoredProcess]: Starting monitored process 248 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) [2025-03-04 15:45:33,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2025-03-04 15:45:33,143 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 [2025-03-04 15:45:33,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,162 INFO L229 MonitoredProcess]: Starting monitored process 249 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) [2025-03-04 15:45:33,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2025-03-04 15:45:33,165 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 [2025-03-04 15:45:33,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2025-03-04 15:45:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,183 INFO L229 MonitoredProcess]: Starting monitored process 250 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) [2025-03-04 15:45:33,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2025-03-04 15:45:33,184 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 [2025-03-04 15:45:33,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,223 INFO L229 MonitoredProcess]: Starting monitored process 251 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) [2025-03-04 15:45:33,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2025-03-04 15:45:33,224 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 [2025-03-04 15:45:33,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2025-03-04 15:45:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,242 INFO L229 MonitoredProcess]: Starting monitored process 252 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) [2025-03-04 15:45:33,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2025-03-04 15:45:33,254 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 [2025-03-04 15:45:33,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2025-03-04 15:45:33,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,278 INFO L229 MonitoredProcess]: Starting monitored process 253 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) [2025-03-04 15:45:33,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2025-03-04 15:45:33,279 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 [2025-03-04 15:45:33,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2025-03-04 15:45:33,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,297 INFO L229 MonitoredProcess]: Starting monitored process 254 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) [2025-03-04 15:45:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2025-03-04 15:45:33,298 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 [2025-03-04 15:45:33,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,316 INFO L229 MonitoredProcess]: Starting monitored process 255 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) [2025-03-04 15:45:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2025-03-04 15:45:33,317 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 [2025-03-04 15:45:33,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,334 INFO L229 MonitoredProcess]: Starting monitored process 256 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) [2025-03-04 15:45:33,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2025-03-04 15:45:33,337 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 [2025-03-04 15:45:33,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2025-03-04 15:45:33,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,354 INFO L229 MonitoredProcess]: Starting monitored process 257 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) [2025-03-04 15:45:33,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2025-03-04 15:45:33,355 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 [2025-03-04 15:45:33,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,372 INFO L229 MonitoredProcess]: Starting monitored process 258 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) [2025-03-04 15:45:33,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2025-03-04 15:45:33,374 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 [2025-03-04 15:45:33,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2025-03-04 15:45:33,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,391 INFO L229 MonitoredProcess]: Starting monitored process 259 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) [2025-03-04 15:45:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2025-03-04 15:45:33,392 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 [2025-03-04 15:45:33,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,411 INFO L229 MonitoredProcess]: Starting monitored process 260 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) [2025-03-04 15:45:33,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2025-03-04 15:45:33,412 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 [2025-03-04 15:45:33,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2025-03-04 15:45:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,429 INFO L229 MonitoredProcess]: Starting monitored process 261 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) [2025-03-04 15:45:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2025-03-04 15:45:33,430 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 [2025-03-04 15:45:33,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2025-03-04 15:45:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,447 INFO L229 MonitoredProcess]: Starting monitored process 262 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) [2025-03-04 15:45:33,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2025-03-04 15:45:33,449 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 [2025-03-04 15:45:33,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2025-03-04 15:45:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,467 INFO L229 MonitoredProcess]: Starting monitored process 263 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) [2025-03-04 15:45:33,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2025-03-04 15:45:33,469 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 [2025-03-04 15:45:33,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2025-03-04 15:45:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,488 INFO L229 MonitoredProcess]: Starting monitored process 264 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) [2025-03-04 15:45:33,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2025-03-04 15:45:33,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 [2025-03-04 15:45:33,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2025-03-04 15:45:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,507 INFO L229 MonitoredProcess]: Starting monitored process 265 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) [2025-03-04 15:45:33,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2025-03-04 15:45:33,508 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 [2025-03-04 15:45:33,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:33,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:33,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:33,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2025-03-04 15:45:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,527 INFO L229 MonitoredProcess]: Starting monitored process 266 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) [2025-03-04 15:45:33,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2025-03-04 15:45:33,529 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 [2025-03-04 15:45:33,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2025-03-04 15:45:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,550 INFO L229 MonitoredProcess]: Starting monitored process 267 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) [2025-03-04 15:45:33,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2025-03-04 15:45:33,551 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 [2025-03-04 15:45:33,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,572 INFO L229 MonitoredProcess]: Starting monitored process 268 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) [2025-03-04 15:45:33,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2025-03-04 15:45:33,574 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 [2025-03-04 15:45:33,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2025-03-04 15:45:33,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,594 INFO L229 MonitoredProcess]: Starting monitored process 269 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) [2025-03-04 15:45:33,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2025-03-04 15:45:33,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 [2025-03-04 15:45:33,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2025-03-04 15:45:33,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,618 INFO L229 MonitoredProcess]: Starting monitored process 270 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) [2025-03-04 15:45:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2025-03-04 15:45:33,619 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 [2025-03-04 15:45:33,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,641 INFO L229 MonitoredProcess]: Starting monitored process 271 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) [2025-03-04 15:45:33,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2025-03-04 15:45:33,642 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 [2025-03-04 15:45:33,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:33,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2025-03-04 15:45:33,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,663 INFO L229 MonitoredProcess]: Starting monitored process 272 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) [2025-03-04 15:45:33,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2025-03-04 15:45:33,664 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 [2025-03-04 15:45:33,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:33,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:33,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:33,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:33,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:33,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:33,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:33,685 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:45:33,685 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:45:33,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:33,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:33,687 INFO L229 MonitoredProcess]: Starting monitored process 273 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) [2025-03-04 15:45:33,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2025-03-04 15:45:33,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:33,697 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:33,698 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:33,698 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-04 15:45:33,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2025-03-04 15:45:33,727 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 15:45:33,730 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:33,730 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:33,730 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:33,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 15:45:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 15:45:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:33,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:33,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:34,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:34,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:34,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:34,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:34,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:34,021 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-04 15:45:34,021 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 84 states and 105 transitions. Complement of second has 5 states. [2025-03-04 15:45:34,045 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 [2025-03-04 15:45:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:34,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 63 letters. Loop has 2 letters. [2025-03-04 15:45:34,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:34,046 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:34,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:34,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 15:45:34,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 15:45:34,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:34,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:34,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:34,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:34,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:34,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:34,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:34,354 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-04 15:45:34,354 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 84 states and 105 transitions. Complement of second has 5 states. [2025-03-04 15:45:34,384 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 [2025-03-04 15:45:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:34,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 63 letters. Loop has 2 letters. [2025-03-04 15:45:34,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:34,384 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:34,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:34,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 15:45:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 15:45:34,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:34,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:34,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:34,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:34,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:34,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:34,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:34,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:34,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:34,683 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-04 15:45:34,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 118 states and 152 transitions. Complement of second has 25 states. [2025-03-04 15:45:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-04 15:45:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2025-03-04 15:45:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2025-03-04 15:45:34,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 63 letters. Loop has 2 letters. [2025-03-04 15:45:34,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:34,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 65 letters. Loop has 2 letters. [2025-03-04 15:45:34,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:34,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 63 letters. Loop has 4 letters. [2025-03-04 15:45:34,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:34,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 152 transitions. [2025-03-04 15:45:34,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:34,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 110 states and 142 transitions. [2025-03-04 15:45:34,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:34,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:34,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 142 transitions. [2025-03-04 15:45:34,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:34,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 142 transitions. [2025-03-04 15:45:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 142 transitions. [2025-03-04 15:45:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2025-03-04 15:45:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 90 states have internal predecessors, (113), 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) [2025-03-04 15:45:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-03-04 15:45:34,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-04 15:45:34,914 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-04 15:45:34,914 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-04 15:45:34,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 113 transitions. [2025-03-04 15:45:34,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:34,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:34,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:34,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-04 15:45:34,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:34,914 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:34,915 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:34,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1408126269, now seen corresponding path program 21 times [2025-03-04 15:45:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:34,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909069633] [2025-03-04 15:45:34,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:34,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 10 equivalence classes. [2025-03-04 15:45:34,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 15:45:34,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:45:34,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:35,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909069633] [2025-03-04 15:45:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909069633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723359276] [2025-03-04 15:45:35,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:35,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:35,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:35,238 INFO L229 MonitoredProcess]: Starting monitored process 274 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:35,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (274)] Waiting until timeout for monitored process [2025-03-04 15:45:35,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 10 equivalence classes. [2025-03-04 15:45:35,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 15:45:35,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:45:35,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:35,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:45:35,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:35,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723359276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:35,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-03-04 15:45:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9302730] [2025-03-04 15:45:35,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:35,789 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 18 times [2025-03-04 15:45:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:35,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171340767] [2025-03-04 15:45:35,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:35,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:35,792 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:35,792 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:45:35,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:35,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:35,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:35,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:35,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 15:45:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 15:45:35,827 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. cyclomatic complexity: 42 Second operand has 34 states, 33 states have (on average 4.0606060606060606) internal successors, (134), 34 states have internal predecessors, (134), 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) [2025-03-04 15:45:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:35,981 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2025-03-04 15:45:35,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 205 transitions. [2025-03-04 15:45:35,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:35,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 92 states and 114 transitions. [2025-03-04 15:45:35,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:35,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:35,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 114 transitions. [2025-03-04 15:45:35,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:35,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-04 15:45:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 114 transitions. [2025-03-04 15:45:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 15:45:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 91 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) [2025-03-04 15:45:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2025-03-04 15:45:35,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-04 15:45:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:45:35,984 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-04 15:45:35,984 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-04 15:45:35,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2025-03-04 15:45:35,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:35,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:35,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:35,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-04 15:45:35,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:35,985 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:35,985 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1022121939, now seen corresponding path program 22 times [2025-03-04 15:45:35,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:35,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027007787] [2025-03-04 15:45:35,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:35,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:35,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-03-04 15:45:36,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:45:36,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:36,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:36,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:45:36,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:45:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 19 times [2025-03-04 15:45:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809015529] [2025-03-04 15:45:36,022 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:36,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:36,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:36,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1288327820, now seen corresponding path program 9 times [2025-03-04 15:45:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165880203] [2025-03-04 15:45:36,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:36,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 10 equivalence classes. [2025-03-04 15:45:36,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:45:36,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:45:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:36,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:45:36,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:45:36,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:36,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:36,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:48,620 WARN L286 SmtUtils]: Spent 12.48s on a formula simplification. DAG size of input: 361 DAG size of output: 272 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:45:48,871 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:48,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:48,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:48,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:48,872 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:48,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:48,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:48,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:48,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration27_Lasso [2025-03-04 15:45:48,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:48,872 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:48,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:48,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:49,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:49,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:49,943 INFO L229 MonitoredProcess]: Starting monitored process 275 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) [2025-03-04 15:45:49,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2025-03-04 15:45:49,947 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 [2025-03-04 15:45:49,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:49,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:49,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:49,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:49,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:49,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:49,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:49,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:49,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:49,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:49,968 INFO L229 MonitoredProcess]: Starting monitored process 276 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) [2025-03-04 15:45:49,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2025-03-04 15:45:49,970 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 [2025-03-04 15:45:49,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:49,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:49,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:49,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:49,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:49,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:49,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:49,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:49,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2025-03-04 15:45:49,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:49,988 INFO L229 MonitoredProcess]: Starting monitored process 277 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) [2025-03-04 15:45:49,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2025-03-04 15:45:49,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 [2025-03-04 15:45:49,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:49,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:49,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:49,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:49,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,007 INFO L229 MonitoredProcess]: Starting monitored process 278 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) [2025-03-04 15:45:50,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2025-03-04 15:45:50,009 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 [2025-03-04 15:45:50,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2025-03-04 15:45:50,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,026 INFO L229 MonitoredProcess]: Starting monitored process 279 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) [2025-03-04 15:45:50,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2025-03-04 15:45:50,028 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 [2025-03-04 15:45:50,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2025-03-04 15:45:50,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,045 INFO L229 MonitoredProcess]: Starting monitored process 280 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) [2025-03-04 15:45:50,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2025-03-04 15:45:50,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,066 INFO L229 MonitoredProcess]: Starting monitored process 281 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) [2025-03-04 15:45:50,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2025-03-04 15:45:50,068 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 [2025-03-04 15:45:50,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2025-03-04 15:45:50,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,087 INFO L229 MonitoredProcess]: Starting monitored process 282 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) [2025-03-04 15:45:50,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2025-03-04 15:45:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,106 INFO L229 MonitoredProcess]: Starting monitored process 283 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) [2025-03-04 15:45:50,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2025-03-04 15:45:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,125 INFO L229 MonitoredProcess]: Starting monitored process 284 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) [2025-03-04 15:45:50,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2025-03-04 15:45:50,126 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 [2025-03-04 15:45:50,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,144 INFO L229 MonitoredProcess]: Starting monitored process 285 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) [2025-03-04 15:45:50,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2025-03-04 15:45:50,145 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 [2025-03-04 15:45:50,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2025-03-04 15:45:50,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,163 INFO L229 MonitoredProcess]: Starting monitored process 286 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) [2025-03-04 15:45:50,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2025-03-04 15:45:50,165 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 [2025-03-04 15:45:50,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2025-03-04 15:45:50,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,184 INFO L229 MonitoredProcess]: Starting monitored process 287 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) [2025-03-04 15:45:50,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,203 INFO L229 MonitoredProcess]: Starting monitored process 288 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) [2025-03-04 15:45:50,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2025-03-04 15:45:50,204 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 [2025-03-04 15:45:50,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:50,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:50,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:50,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,221 INFO L229 MonitoredProcess]: Starting monitored process 289 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) [2025-03-04 15:45:50,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2025-03-04 15:45:50,223 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 [2025-03-04 15:45:50,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Ended with exit code 0 [2025-03-04 15:45:50,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,244 INFO L229 MonitoredProcess]: Starting monitored process 290 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) [2025-03-04 15:45:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,267 INFO L229 MonitoredProcess]: Starting monitored process 291 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) [2025-03-04 15:45:50,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2025-03-04 15:45:50,269 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 [2025-03-04 15:45:50,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2025-03-04 15:45:50,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,290 INFO L229 MonitoredProcess]: Starting monitored process 292 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) [2025-03-04 15:45:50,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2025-03-04 15:45:50,292 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 [2025-03-04 15:45:50,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,311 INFO L229 MonitoredProcess]: Starting monitored process 293 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) [2025-03-04 15:45:50,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2025-03-04 15:45:50,312 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 [2025-03-04 15:45:50,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2025-03-04 15:45:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,332 INFO L229 MonitoredProcess]: Starting monitored process 294 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) [2025-03-04 15:45:50,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2025-03-04 15:45:50,333 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 [2025-03-04 15:45:50,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2025-03-04 15:45:50,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,355 INFO L229 MonitoredProcess]: Starting monitored process 295 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) [2025-03-04 15:45:50,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2025-03-04 15:45:50,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,378 INFO L229 MonitoredProcess]: Starting monitored process 296 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) [2025-03-04 15:45:50,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2025-03-04 15:45:50,379 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 [2025-03-04 15:45:50,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Ended with exit code 0 [2025-03-04 15:45:50,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,403 INFO L229 MonitoredProcess]: Starting monitored process 297 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) [2025-03-04 15:45:50,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2025-03-04 15:45:50,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,426 INFO L229 MonitoredProcess]: Starting monitored process 298 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) [2025-03-04 15:45:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2025-03-04 15:45:50,427 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 [2025-03-04 15:45:50,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,449 INFO L229 MonitoredProcess]: Starting monitored process 299 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) [2025-03-04 15:45:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2025-03-04 15:45:50,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 [2025-03-04 15:45:50,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,475 INFO L229 MonitoredProcess]: Starting monitored process 300 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) [2025-03-04 15:45:50,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2025-03-04 15:45:50,477 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 [2025-03-04 15:45:50,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:50,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,501 INFO L229 MonitoredProcess]: Starting monitored process 301 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) [2025-03-04 15:45:50,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2025-03-04 15:45:50,503 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 [2025-03-04 15:45:50,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:50,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:50,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:50,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:50,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:50,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:50,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:50,526 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:45:50,526 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:45:50,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:50,529 INFO L229 MonitoredProcess]: Starting monitored process 302 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) [2025-03-04 15:45:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2025-03-04 15:45:50,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:50,542 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:50,542 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:50,542 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1 Supporting invariants [] [2025-03-04 15:45:50,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:50,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2025-03-04 15:45:50,671 INFO L156 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2025-03-04 15:45:50,675 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:50,675 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:50,675 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-04 15:45:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:45:50,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:45:50,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:50,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:50,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:45:50,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:51,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:51,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:51,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:51,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:51,104 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 [2025-03-04 15:45:51,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:51,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 93 states and 116 transitions. Complement of second has 5 states. [2025-03-04 15:45:51,131 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 [2025-03-04 15:45:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:51,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 70 letters. Loop has 2 letters. [2025-03-04 15:45:51,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:51,131 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:45:51,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:45:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:51,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:45:51,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:51,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:51,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:51,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:51,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:51,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:51,577 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 [2025-03-04 15:45:51,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:51,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 93 states and 116 transitions. Complement of second has 5 states. [2025-03-04 15:45:51,603 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 [2025-03-04 15:45:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-04 15:45:51,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 70 letters. Loop has 2 letters. [2025-03-04 15:45:51,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:51,603 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:51,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:51,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:45:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:45:51,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:51,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:51,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:45:51,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:51,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:51,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:51,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:51,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:52,016 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 [2025-03-04 15:45:52,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:52,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 128 states and 165 transitions. Complement of second has 27 states. [2025-03-04 15:45:52,300 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 [2025-03-04 15:45:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2025-03-04 15:45:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2025-03-04 15:45:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 70 letters. Loop has 2 letters. [2025-03-04 15:45:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 72 letters. Loop has 2 letters. [2025-03-04 15:45:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 70 letters. Loop has 4 letters. [2025-03-04 15:45:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:52,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2025-03-04 15:45:52,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:52,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 120 states and 155 transitions. [2025-03-04 15:45:52,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:52,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:52,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 155 transitions. [2025-03-04 15:45:52,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:52,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2025-03-04 15:45:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 155 transitions. [2025-03-04 15:45:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2025-03-04 15:45:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.24) internal successors, (124), 99 states have internal predecessors, (124), 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) [2025-03-04 15:45:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2025-03-04 15:45:52,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-03-04 15:45:52,303 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-03-04 15:45:52,304 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-04 15:45:52,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 124 transitions. [2025-03-04 15:45:52,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:52,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:52,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:52,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 15:45:52,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:52,305 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:52,305 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:52,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1660638902, now seen corresponding path program 23 times [2025-03-04 15:45:52,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:52,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232659596] [2025-03-04 15:45:52,305 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:52,312 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-03-04 15:45:52,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:45:52,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:45:52,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232659596] [2025-03-04 15:45:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232659596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476163985] [2025-03-04 15:45:52,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:52,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:52,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:52,657 INFO L229 MonitoredProcess]: Starting monitored process 303 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:52,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (303)] Waiting until timeout for monitored process [2025-03-04 15:45:52,763 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-03-04 15:45:52,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 15:45:52,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:45:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:52,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:52,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:53,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476163985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:53,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:53,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2025-03-04 15:45:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093876844] [2025-03-04 15:45:53,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:53,291 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:53,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 20 times [2025-03-04 15:45:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459073318] [2025-03-04 15:45:53,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:53,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:53,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:53,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:53,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:53,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:53,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:53,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:53,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 15:45:53,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 15:45:53,331 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. cyclomatic complexity: 46 Second operand has 35 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 states have internal predecessors, (138), 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) [2025-03-04 15:45:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:53,480 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2025-03-04 15:45:53,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 226 transitions. [2025-03-04 15:45:53,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:53,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 101 states and 125 transitions. [2025-03-04 15:45:53,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:53,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:53,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 125 transitions. [2025-03-04 15:45:53,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:53,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-03-04 15:45:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 125 transitions. [2025-03-04 15:45:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 15:45:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 100 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) [2025-03-04 15:45:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2025-03-04 15:45:53,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-03-04 15:45:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:45:53,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-03-04 15:45:53,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-04 15:45:53,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 125 transitions. [2025-03-04 15:45:53,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:53,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:53,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:53,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 15:45:53,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:53,484 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:53,484 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 470308364, now seen corresponding path program 24 times [2025-03-04 15:45:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855196856] [2025-03-04 15:45:53,484 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:53,491 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 11 equivalence classes. [2025-03-04 15:45:53,509 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:45:53,510 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 15:45:53,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:53,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:45:53,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:45:53,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:53,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:53,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:53,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 21 times [2025-03-04 15:45:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:53,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519845581] [2025-03-04 15:45:53,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:53,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:53,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:53,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:53,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:53,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:53,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:53,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:53,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash 994772139, now seen corresponding path program 10 times [2025-03-04 15:45:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045178392] [2025-03-04 15:45:53,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:53,541 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-03-04 15:45:53,560 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 15:45:53,560 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:53,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 15:45:53,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 15:45:53,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:53,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:53,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:08,049 WARN L286 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 392 DAG size of output: 298 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:46:08,892 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:08,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:08,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:08,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:08,892 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:08,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:08,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:08,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:08,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration29_Lasso [2025-03-04 15:46:08,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:08,892 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:08,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:08,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:08,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:08,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:12,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:12,554 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:12,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,556 INFO L229 MonitoredProcess]: Starting monitored process 304 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) [2025-03-04 15:46:12,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2025-03-04 15:46:12,559 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 [2025-03-04 15:46:12,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:12,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:12,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:12,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:12,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2025-03-04 15:46:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,578 INFO L229 MonitoredProcess]: Starting monitored process 305 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) [2025-03-04 15:46:12,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2025-03-04 15:46:12,580 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 [2025-03-04 15:46:12,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:12,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:12,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:12,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:12,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2025-03-04 15:46:12,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,599 INFO L229 MonitoredProcess]: Starting monitored process 306 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) [2025-03-04 15:46:12,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2025-03-04 15:46:12,600 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 [2025-03-04 15:46:12,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:12,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:12,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:12,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Ended with exit code 0 [2025-03-04 15:46:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,620 INFO L229 MonitoredProcess]: Starting monitored process 307 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) [2025-03-04 15:46:12,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2025-03-04 15:46:12,622 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 [2025-03-04 15:46:12,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:12,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:12,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:12,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Ended with exit code 0 [2025-03-04 15:46:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,644 INFO L229 MonitoredProcess]: Starting monitored process 308 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) [2025-03-04 15:46:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2025-03-04 15:46:12,646 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 [2025-03-04 15:46:12,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:12,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:12,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:12,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2025-03-04 15:46:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,670 INFO L229 MonitoredProcess]: Starting monitored process 309 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) [2025-03-04 15:46:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2025-03-04 15:46:12,672 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 [2025-03-04 15:46:12,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:12,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:12,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:12,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:12,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:12,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:12,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:12,693 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:46:12,694 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:46:12,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:12,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:12,695 INFO L229 MonitoredProcess]: Starting monitored process 310 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) [2025-03-04 15:46:12,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2025-03-04 15:46:12,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:12,707 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:46:12,707 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:12,707 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-04 15:46:12,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Ended with exit code 0 [2025-03-04 15:46:12,803 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2025-03-04 15:46:12,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:46:12,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:46:12,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-04 15:46:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:12,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:46:12,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:46:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:12,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:46:12,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:13,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:13,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:13,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:13,070 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 [2025-03-04 15:46:13,071 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 102 states and 127 transitions. Complement of second has 4 states. [2025-03-04 15:46:13,090 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 [2025-03-04 15:46:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:46:13,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 77 letters. Loop has 2 letters. [2025-03-04 15:46:13,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:13,090 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:46:13,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:13,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:46:13,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:46:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:13,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:46:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:13,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:13,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:13,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:13,345 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 [2025-03-04 15:46:13,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 102 states and 127 transitions. Complement of second has 4 states. [2025-03-04 15:46:13,360 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 [2025-03-04 15:46:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:46:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 77 letters. Loop has 2 letters. [2025-03-04 15:46:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:13,361 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:46:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:13,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:46:13,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:46:13,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:13,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:46:13,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Ended with exit code 0 [2025-03-04 15:46:13,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:13,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:13,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:13,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:13,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:13,654 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 [2025-03-04 15:46:13,654 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,929 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 138 states and 178 transitions. Complement of second has 28 states. [2025-03-04 15:46:13,929 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 [2025-03-04 15:46:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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) [2025-03-04 15:46:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2025-03-04 15:46:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 77 letters. Loop has 2 letters. [2025-03-04 15:46:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 79 letters. Loop has 2 letters. [2025-03-04 15:46:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 77 letters. Loop has 4 letters. [2025-03-04 15:46:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:13,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 178 transitions. [2025-03-04 15:46:13,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:13,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 130 states and 168 transitions. [2025-03-04 15:46:13,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:46:13,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:46:13,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 168 transitions. [2025-03-04 15:46:13,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:13,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 168 transitions. [2025-03-04 15:46:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 168 transitions. [2025-03-04 15:46:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2025-03-04 15:46:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.238532110091743) internal successors, (135), 108 states have internal predecessors, (135), 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) [2025-03-04 15:46:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2025-03-04 15:46:13,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-03-04 15:46:13,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-03-04 15:46:13,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-04 15:46:13,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 135 transitions. [2025-03-04 15:46:13,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:13,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:13,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:13,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 15:46:13,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:46:13,933 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:46:13,934 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:46:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -544743083, now seen corresponding path program 25 times [2025-03-04 15:46:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340349634] [2025-03-04 15:46:13,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:46:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:13,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 15:46:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 15:46:13,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 280 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340349634] [2025-03-04 15:46:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340349634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:46:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159411084] [2025-03-04 15:46:14,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:46:14,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:46:14,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:14,281 INFO L229 MonitoredProcess]: Starting monitored process 311 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:46:14,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (311)] Waiting until timeout for monitored process [2025-03-04 15:46:14,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 15:46:14,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 15:46:14,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:14,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:14,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:46:14,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:14,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:46:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159411084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:46:15,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:46:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-03-04 15:46:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171530660] [2025-03-04 15:46:15,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:46:15,062 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:15,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 22 times [2025-03-04 15:46:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439834312] [2025-03-04 15:46:15,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:46:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:15,065 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:46:15,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:15,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:46:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:15,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:15,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:15,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:15,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 15:46:15,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 15:46:15,100 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. cyclomatic complexity: 50 Second operand has 40 states, 39 states have (on average 4.102564102564102) internal successors, (160), 40 states have internal predecessors, (160), 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) [2025-03-04 15:46:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:15,363 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-03-04 15:46:15,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 247 transitions. [2025-03-04 15:46:15,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:15,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 110 states and 136 transitions. [2025-03-04 15:46:15,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:46:15,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:46:15,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 136 transitions. [2025-03-04 15:46:15,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:15,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-03-04 15:46:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 136 transitions. [2025-03-04 15:46:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 15:46:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 109 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) [2025-03-04 15:46:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2025-03-04 15:46:15,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-03-04 15:46:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:46:15,366 INFO L432 stractBuchiCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-03-04 15:46:15,366 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-04 15:46:15,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 136 transitions. [2025-03-04 15:46:15,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:15,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:15,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:15,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 15:46:15,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:46:15,367 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:46:15,367 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:46:15,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1381176639, now seen corresponding path program 26 times [2025-03-04 15:46:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118969464] [2025-03-04 15:46:15,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:46:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:15,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 15:46:15,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 15:46:15,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:46:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:15,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 15:46:15,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 15:46:15,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:15,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 23 times [2025-03-04 15:46:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509213293] [2025-03-04 15:46:15,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:46:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:15,411 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:15,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:15,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:46:15,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:15,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:15,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:15,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 165856030, now seen corresponding path program 11 times [2025-03-04 15:46:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:15,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455239027] [2025-03-04 15:46:15,415 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:46:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:15,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 12 equivalence classes. [2025-03-04 15:46:15,445 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 15:46:15,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-04 15:46:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:15,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 15:46:15,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 15:46:15,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:15,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:15,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace