./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array01-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/array01-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 c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:44:42,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:44:42,210 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:42,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:44:42,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:44:42,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:44:42,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:44:42,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:44:42,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:44:42,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:44:42,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:44:42,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:44:42,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:44:42,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:44:42,242 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:44:42,242 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:44:42,242 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:44:42,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:44:42,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:44:42,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:44:42,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:44:42,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:44:42,245 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:44:42,245 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 -> c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 [2025-03-04 15:44:42,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:44:42,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:44:42,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:44:42,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:44:42,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:44:42,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2025-03-04 15:44:43,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a68c1ede/740c680cc7a64e098711e22a1b3e35f5/FLAGa7c1fc438 [2025-03-04 15:44:43,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:44:43,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2025-03-04 15:44:43,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a68c1ede/740c680cc7a64e098711e22a1b3e35f5/FLAGa7c1fc438 [2025-03-04 15:44:44,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a68c1ede/740c680cc7a64e098711e22a1b3e35f5 [2025-03-04 15:44:44,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:44:44,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:44:44,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:44,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:44:44,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:44:44,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:44" (1/1) ... [2025-03-04 15:44:44,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd5666c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:44, skipping insertion in model container [2025-03-04 15:44:44,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:44" (1/1) ... [2025-03-04 15:44:44,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:44:44,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:44,426 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:44:44,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:44,482 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:44:44,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:44 WrapperNode [2025-03-04 15:44:44,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:44,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:44,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:44:44,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:44:44,488 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:44" (1/1) ... [2025-03-04 15:44:44,498 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:44" (1/1) ... [2025-03-04 15:44:44,512 INFO L138 Inliner]: procedures = 116, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-04 15:44:44,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:44,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:44:44,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:44:44,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:44:44,518 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:44" (1/1) ... [2025-03-04 15:44:44,518 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:44" (1/1) ... [2025-03-04 15:44:44,521 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:44" (1/1) ... [2025-03-04 15:44:44,533 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 15:44:44,533 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:44" (1/1) ... [2025-03-04 15:44:44,533 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:44" (1/1) ... [2025-03-04 15:44:44,536 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:44" (1/1) ... [2025-03-04 15:44:44,539 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:44" (1/1) ... [2025-03-04 15:44:44,540 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:44" (1/1) ... [2025-03-04 15:44:44,540 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:44" (1/1) ... [2025-03-04 15:44:44,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:44:44,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:44:44,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:44:44,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:44:44,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:44" (1/1) ... [2025-03-04 15:44:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:44,570 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:44,573 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:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:44:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:44:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:44:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:44:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:44:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:44:44,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:44:44,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:44:44,780 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-04 15:44:44,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:44:44,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:44:44,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:44:44,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:44 BoogieIcfgContainer [2025-03-04 15:44:44,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:44:44,787 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:44:44,787 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:44:44,791 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:44:44,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:44,791 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:44:44" (1/3) ... [2025-03-04 15:44:44,792 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f4f0dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:44, skipping insertion in model container [2025-03-04 15:44:44,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:44,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:44" (2/3) ... [2025-03-04 15:44:44,793 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f4f0dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:44, skipping insertion in model container [2025-03-04 15:44:44,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:44,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:44" (3/3) ... [2025-03-04 15:44:44,794 INFO L363 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2025-03-04 15:44:44,832 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:44:44,832 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:44:44,832 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:44:44,833 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:44:44,833 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:44:44,834 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:44:44,834 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:44:44,834 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:44:44,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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:44,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 15:44:44,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:44,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:44,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:44:44,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:44,853 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:44:44,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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:44,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 15:44:44,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:44,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:44,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:44:44,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:44,859 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" [2025-03-04 15:44:44,860 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:44:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times [2025-03-04 15:44:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790278365] [2025-03-04 15:44:44,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:44,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:44,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:44,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:44,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:44,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:44,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:44,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:44,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:44,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-04 15:44:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138504208] [2025-03-04 15:44:44,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:44,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:44,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:44,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:44,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:44,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 45773838, now seen corresponding path program 1 times [2025-03-04 15:44:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482711989] [2025-03-04 15:44:44,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:44,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:45,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:45,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:45,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:45,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:45,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:45,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:45,254 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:45,255 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:45,255 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:45,255 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:45,255 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:45,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:45,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:45,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2025-03-04 15:44:45,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:45,256 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:45,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:45,521 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:45,524 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,527 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:45,529 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:45,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:45,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:45,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:45,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:45,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:45,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:45,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:45,559 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:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,561 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:45,562 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:45,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:45,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:45,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:45,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:45,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:45,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:45,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:45,586 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:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,588 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:45,589 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:45,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:45,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:45,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:45,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:45,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:45,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:45,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:45,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:45,611 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:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,613 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:45,614 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:45,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:45,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:45,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:45,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:45,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:45,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:45,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:45,637 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:45,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,639 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:45,641 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:45,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:44:45,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:45,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:45,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:45,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:45,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:45,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:45,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:45,688 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-04 15:44:45,690 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:44:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:45,694 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:45,695 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:45,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:45,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:45,708 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:45,708 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:45,714 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:45,722 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:44:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:45,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:45,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:45,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:45,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:45,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:45,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:45,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:45,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:45,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:45,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:44:45,798 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:45,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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) 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:45,834 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:45,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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). 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 15 states and 21 transitions. Complement of second has 3 states. [2025-03-04 15:44:45,839 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:45,842 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:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-04 15:44:45,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-04 15:44:45,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:45,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 15:44:45,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:45,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:44:45,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:45,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-04 15:44:45,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:45,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 16 transitions. [2025-03-04 15:44:45,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:45,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:45,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-03-04 15:44:45,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:45,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-04 15:44:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-03-04 15:44:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-04 15:44:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-04 15:44:45,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-04 15:44:45,866 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-04 15:44:45,866 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:44:45,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-04 15:44:45,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:45,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:45,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:45,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:44:45,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:45,867 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:45,867 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume !true;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-04 15:44:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 45773837, now seen corresponding path program 1 times [2025-03-04 15:44:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619318940] [2025-03-04 15:44:45,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:45,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:45,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:45,958 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:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619318940] [2025-03-04 15:44:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619318940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406296048] [2025-03-04 15:44:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:45,960 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-03-04 15:44:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:45,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278793973] [2025-03-04 15:44:45,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:45,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:45,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:45,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:45,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:45,968 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:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278793973] [2025-03-04 15:44:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278793973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:44:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725444482] [2025-03-04 15:44:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:45,968 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:44:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:45,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:44:45,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:44:45,970 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:45,973 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-04 15:44:45,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-04 15:44:45,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:45,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:44:45,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:45,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:44:45,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:44:45,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:45,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:44:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:44:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:44:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:44:45,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:44:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:44:45,974 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:44:45,974 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:44:45,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-04 15:44:45,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:45,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:45,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:45,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:44:45,975 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:44:45,975 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:45,975 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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-04 15:44:45,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 45773837, now seen corresponding path program 2 times [2025-03-04 15:44:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978338300] [2025-03-04 15:44:45,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:45,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:45,982 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:45,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:46,019 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:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:46,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978338300] [2025-03-04 15:44:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978338300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:46,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387712744] [2025-03-04 15:44:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:46,020 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-03-04 15:44:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600609398] [2025-03-04 15:44:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:46,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:46,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:46,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:46,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:46,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:46,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:46,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:46,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:44:46,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:44:46,063 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 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:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:46,074 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2025-03-04 15:44:46,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2025-03-04 15:44:46,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:46,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2025-03-04 15:44:46,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:46,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:44:46,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2025-03-04 15:44:46,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:46,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-04 15:44:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2025-03-04 15:44:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:44:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-03-04 15:44:46,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-04 15:44:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:44:46,076 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-04 15:44:46,076 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:44:46,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2025-03-04 15:44:46,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:44:46,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:46,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:46,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:44:46,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:44:46,077 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-04 15:44:46,077 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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" [2025-03-04 15:44:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988990, now seen corresponding path program 1 times [2025-03-04 15:44:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809894117] [2025-03-04 15:44:46,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:46,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:46,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:46,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:46,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:46,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:46,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 2 times [2025-03-04 15:44:46,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:46,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309695007] [2025-03-04 15:44:46,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:46,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:46,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:46,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:46,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1405083271, now seen corresponding path program 1 times [2025-03-04 15:44:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249197418] [2025-03-04 15:44:46,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:44:46,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:44:46,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:46,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:44:46,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:44:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:46,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:46,361 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:46,361 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:46,361 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:46,361 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:46,361 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:46,361 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:46,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:46,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2025-03-04 15:44:46,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:46,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:46,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:46,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:46,629 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,633 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:46,634 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:46,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:46,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,657 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:46,659 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:46,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:46,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,676 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:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,678 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:46,679 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:46,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:46,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,695 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:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,697 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:46,698 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:46,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:46,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,715 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:46,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,717 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:46,718 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:46,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:46,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:44:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,737 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:46,738 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:46,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:46,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,756 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:46,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,758 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:46,759 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:46,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:46,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:46,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,779 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:46,794 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:46,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:46,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,811 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:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,812 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:46,813 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:46,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:46,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:44:46,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,835 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:46,835 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:46,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:46,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,853 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:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,855 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:46,855 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:46,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:46,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:46,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:46,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:46,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:44:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,874 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:46,875 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:46,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:46,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:44:46,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,899 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:46,900 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:46,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:44:46,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,922 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:46,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,924 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:46,925 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:46,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:46,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:46,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,949 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:46,950 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:46,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:46,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:46,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:46,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:46,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:46,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:46,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:46,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:46,994 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-04 15:44:46,994 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-04 15:44:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:46,995 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:46,996 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:46,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:47,007 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:47,007 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:47,007 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:47,013 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:47,019 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:44:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:47,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:47,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:47,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:47,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:47,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:44:47,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:44:47,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:47,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:47,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:47,076 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:47,076 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:47,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:47,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 15 states and 20 transitions. Complement of second has 4 states. [2025-03-04 15:44:47,093 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:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:44:47,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:44:47,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-04 15:44:47,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 8 letters. [2025-03-04 15:44:47,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-04 15:44:47,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:47,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 19 transitions. [2025-03-04 15:44:47,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:47,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:44:47,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-03-04 15:44:47,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:47,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-04 15:44:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-03-04 15:44:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-04 15:44:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-04 15:44:47,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:44:47,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:44:47,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:44:47,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-04 15:44:47,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:47,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:47,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:47,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:47,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:47,099 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:47,099 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1038985741, now seen corresponding path program 1 times [2025-03-04 15:44:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72817265] [2025-03-04 15:44:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:47,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:47,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:47,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:47,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-04 15:44:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147884968] [2025-03-04 15:44:47,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:47,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:47,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:47,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:47,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:47,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:47,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2032884716, now seen corresponding path program 1 times [2025-03-04 15:44:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396765014] [2025-03-04 15:44:47,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:47,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:47,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:47,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:47,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:44:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:44:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:47,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:47,388 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:47,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:47,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:47,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:47,389 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:47,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:47,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:47,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration5_Lasso [2025-03-04 15:44:47,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:47,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:47,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:47,635 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:47,635 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,637 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:47,639 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:47,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:47,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:47,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:47,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:47,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,659 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:47,660 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:47,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:44:47,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:47,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:47,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:47,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,677 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:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,679 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:47,679 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:47,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:47,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:47,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:47,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:47,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,697 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:47,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,699 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:47,700 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:47,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:44:47,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:47,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:47,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:47,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,717 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:47,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,719 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:47,720 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:47,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:44:47,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:47,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:47,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,739 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:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,741 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:47,743 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:47,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:47,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:47,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:47,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,764 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:47,766 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:47,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:47,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:47,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:47,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,789 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:47,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,791 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:47,792 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:47,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:47,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:47,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:47,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:47,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,818 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:47,820 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:47,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:47,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:47,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:47,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:47,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:47,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:47,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:47,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:47,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:47,839 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:44:47,840 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:44:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:47,842 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:47,844 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:47,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:47,845 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:44:47,845 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:47,845 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 (* ULTIMATE.start_test_fun_~i~0#1 4)))_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset (* ULTIMATE.start_test_fun_~i~0#1 4)))_2 Supporting invariants [] [2025-03-04 15:44:47,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:47,858 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:44:47,860 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:47,861 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:47,861 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:47,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:44:47,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:44:47,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:47,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:47,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:47,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:47,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:47,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:47,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:44:47,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:47,909 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:47,910 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:47,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:47,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 29 transitions. Complement of second has 7 states. [2025-03-04 15:44:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:44:47,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-04 15:44:47,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-04 15:44:47,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:44:47,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:47,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-03-04 15:44:47,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:47,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2025-03-04 15:44:47,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:47,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:47,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2025-03-04 15:44:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:47,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-04 15:44:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2025-03-04 15:44:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-04 15:44:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-04 15:44:47,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-04 15:44:47,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-04 15:44:47,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:44:47,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-04 15:44:47,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:47,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:47,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:47,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:47,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:47,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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1;" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:47,931 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:47,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash -607908430, now seen corresponding path program 2 times [2025-03-04 15:44:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788896088] [2025-03-04 15:44:47,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:47,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:44:47,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:47,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:47,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:47,965 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2025-03-04 15:44:47,965 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:47,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:44:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:44:48,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:48,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788896088] [2025-03-04 15:44:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788896088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:48,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533174475] [2025-03-04 15:44:48,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:48,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:48,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:48,029 INFO L229 MonitoredProcess]: Starting monitored process 34 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:48,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 15:44:48,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:44:48,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:48,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:48,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:48,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:44:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:44:48,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:44:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533174475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:48,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:44:48,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:44:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924419689] [2025-03-04 15:44:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:48,104 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-04 15:44:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048361349] [2025-03-04 15:44:48,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:48,109 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:48,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:48,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:48,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:48,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:48,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:44:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:44:48,144 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:48,168 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-04 15:44:48,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2025-03-04 15:44:48,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:48,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 20 transitions. [2025-03-04 15:44:48,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:48,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:48,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2025-03-04 15:44:48,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:48,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-04 15:44:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2025-03-04 15:44:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:44:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-04 15:44:48,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-04 15:44:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:44:48,172 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-04 15:44:48,172 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:44:48,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-04 15:44:48,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:48,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:48,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:48,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:48,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:48,173 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:48,173 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1879604403, now seen corresponding path program 1 times [2025-03-04 15:44:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349518640] [2025-03-04 15:44:48,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:48,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:48,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:48,230 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:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349518640] [2025-03-04 15:44:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349518640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234032104] [2025-03-04 15:44:48,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:48,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:48,233 INFO L229 MonitoredProcess]: Starting monitored process 35 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:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 15:44:48,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:48,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:48,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:48,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:48,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:48,309 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:48,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:48,336 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:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234032104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:48,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 15:44:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587812989] [2025-03-04 15:44:48,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:48,337 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-04 15:44:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213214846] [2025-03-04 15:44:48,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:48,342 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:48,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:48,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:48,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:48,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:48,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:44:48,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:44:48,376 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 8 Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 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:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:48,406 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-04 15:44:48,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2025-03-04 15:44:48,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:48,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 21 transitions. [2025-03-04 15:44:48,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:48,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:48,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2025-03-04 15:44:48,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:48,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-04 15:44:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2025-03-04 15:44:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 15:44:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-04 15:44:48,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-04 15:44:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:44:48,411 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-04 15:44:48,411 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:44:48,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2025-03-04 15:44:48,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:48,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:48,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:48,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:48,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:48,412 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:48,412 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash -943763518, now seen corresponding path program 2 times [2025-03-04 15:44:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826706929] [2025-03-04 15:44:48,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:44:48,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:48,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:48,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:48,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:48,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-04 15:44:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973560348] [2025-03-04 15:44:48,434 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:44:48,438 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:48,438 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:48,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:48,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:48,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:48,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash -718641055, now seen corresponding path program 1 times [2025-03-04 15:44:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954618291] [2025-03-04 15:44:48,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:48,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:48,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:48,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:48,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:48,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:48,730 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:48,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:48,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:48,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:48,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:48,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:48,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:48,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:48,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration8_Lasso [2025-03-04 15:44:48,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:48,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:48,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:48,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:49,041 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:49,041 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,043 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:49,044 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:49,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:44:49,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:44:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,063 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:49,064 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:49,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,083 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:49,084 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:49,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,103 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:49,104 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:49,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,120 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:49,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,123 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:49,123 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:49,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:44:49,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,140 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:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,142 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:49,142 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:49,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:44:49,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,160 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:49,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,162 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:49,163 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:49,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:44:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,181 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:49,182 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:49,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,201 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:49,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,203 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:49,205 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:49,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,226 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:49,226 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:49,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,244 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:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,247 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:49,247 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:49,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,265 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:49,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,267 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:49,268 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:49,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:44:49,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,286 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:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,288 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:49,289 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:49,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,305 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:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,307 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:49,308 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:49,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:44:49,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,332 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:49,333 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:49,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,353 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:49,354 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:49,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:44:49,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,373 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:49,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,375 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:49,376 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:49,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:44:49,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,393 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:49,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,393 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 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:49,395 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:49,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,412 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:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,414 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:49,415 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:49,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:49,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:49,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:49,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:44:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,434 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:49,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:44:49,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:49,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:44:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,456 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:49,457 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:49,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:44:49,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:44:49,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,479 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:49,480 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:49,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:49,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:49,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 15:44:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,503 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:49,504 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:49,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:49,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:49,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:49,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:49,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:49,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:49,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:49,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:49,532 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:49,532 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:44:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:49,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:49,534 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:49,535 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:49,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:49,545 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:49,546 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:49,546 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1 Supporting invariants [] [2025-03-04 15:44:49,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,560 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-04 15:44:49,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:49,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:49,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-04 15:44:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:49,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:49,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,668 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:49,669 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:49,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 18 states and 23 transitions. Complement of second has 5 states. [2025-03-04 15:44:49,686 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:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:49,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 15:44:49,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:49,687 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:49,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:49,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:49,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:49,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,791 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:49,792 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:49,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 18 states and 23 transitions. Complement of second has 5 states. [2025-03-04 15:44:49,815 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:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:49,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 15:44:49,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:49,815 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:44:49,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:44:49,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:49,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:49,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:49,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:49,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:44:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:49,918 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:49,918 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:49,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:49,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 32 states and 40 transitions. Complement of second has 11 states. [2025-03-04 15:44:49,990 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:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-03-04 15:44:49,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 15:44:49,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:49,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 15:44:49,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:49,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-04 15:44:49,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:49,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2025-03-04 15:44:49,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:49,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 33 transitions. [2025-03-04 15:44:49,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:49,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:49,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2025-03-04 15:44:49,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:49,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-04 15:44:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2025-03-04 15:44:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-04 15:44:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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:44:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-04 15:44:49,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-04 15:44:49,993 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-04 15:44:49,993 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:44:49,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-03-04 15:44:49,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:49,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:49,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:49,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:49,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:49,993 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:49,993 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 875679975, now seen corresponding path program 3 times [2025-03-04 15:44:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495690762] [2025-03-04 15:44:49,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:49,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-04 15:44:50,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:50,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:44:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495690762] [2025-03-04 15:44:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495690762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118027672] [2025-03-04 15:44:50,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:50,062 INFO L229 MonitoredProcess]: Starting monitored process 60 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:50,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-04 15:44:50,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-04 15:44:50,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:50,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:44:50,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:50,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:50,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:50,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118027672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:50,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:50,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 15:44:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917780502] [2025-03-04 15:44:50,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:50,195 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:50,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-03-04 15:44:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549235367] [2025-03-04 15:44:50,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:50,199 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:50,199 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:50,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:50,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:50,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:44:50,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:44:50,230 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 10 Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 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:44:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:50,259 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-04 15:44:50,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2025-03-04 15:44:50,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:50,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 28 transitions. [2025-03-04 15:44:50,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:50,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:50,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2025-03-04 15:44:50,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:50,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-04 15:44:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2025-03-04 15:44:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-04 15:44:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 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,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-04 15:44:50,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-04 15:44:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:44:50,263 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-04 15:44:50,263 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:44:50,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-03-04 15:44:50,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:50,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:50,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:50,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:50,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:50,263 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:50,264 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:50,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1717538616, now seen corresponding path program 4 times [2025-03-04 15:44:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090194339] [2025-03-04 15:44:50,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 15:44:50,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:44:50,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:50,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:50,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:44:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:44:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:50,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-03-04 15:44:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907091390] [2025-03-04 15:44:50,295 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:44:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,297 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:50,298 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:50,298 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:44:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:50,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1287168599, now seen corresponding path program 2 times [2025-03-04 15:44:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627382590] [2025-03-04 15:44:50,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:50,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:44:50,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:50,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:50,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:44:50,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:50,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:50,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:50,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:50,787 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:50,787 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:50,787 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:50,787 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:50,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:50,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:50,787 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:50,787 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:50,787 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration10_Lasso [2025-03-04 15:44:50,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:50,787 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:50,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:50,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:51,188 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:51,188 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:51,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,190 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:51,191 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:51,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,209 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:51,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,211 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:51,211 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:51,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,236 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:51,237 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:51,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:51,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,255 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:51,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,257 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:51,258 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:51,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:44:51,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,275 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:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,277 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:51,278 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:51,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:44:51,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,296 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:51,296 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:51,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:44:51,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:44:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,315 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:51,315 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:51,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,332 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:51,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,334 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:51,334 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:51,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:44:51,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,353 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:51,353 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:51,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,370 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:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,372 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:51,373 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:51,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:44:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,393 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:51,394 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:51,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,410 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:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,412 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:51,412 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:51,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,429 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:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,430 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:51,431 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:51,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,447 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:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,449 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:51,449 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:51,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,469 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:51,470 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:51,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,486 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:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,487 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:51,488 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:51,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:51,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:51,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:51,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:51,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,505 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:51,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,507 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:51,507 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:51,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:44:51,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 15:44:51,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,532 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:51,532 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:51,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,552 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:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,554 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:51,555 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:51,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:44:51,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:44:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,580 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:51,580 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:51,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,600 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:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,602 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:51,602 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:51,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:51,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,622 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:51,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,624 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:51,625 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:51,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:51,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 15:44:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,645 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:51,646 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:51,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:44:51,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:51,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:51,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,666 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:51,666 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:51,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:51,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:51,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:51,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:51,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:51,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:51,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:51,687 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:44:51,687 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-04 15:44:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:51,689 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:51,690 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:51,690 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:51,700 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:51,700 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:51,700 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 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 8))_1 Supporting invariants [] [2025-03-04 15:44:51,706 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:51,718 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:44:51,719 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:51,720 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:51,720 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:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:51,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:44:51,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:44:51,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:51,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:51,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:51,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:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:51,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:51,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:51,814 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:51,814 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:51,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10 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:51,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10. 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 24 states and 30 transitions. Complement of second has 4 states. [2025-03-04 15:44:51,832 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:44:51,832 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:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:44:51,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:44:51,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:51,832 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:51,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:51,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:44:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:44:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:51,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:51,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:51,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:51,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:51,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:51,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:51,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:51,939 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:51,940 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:51,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10 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:51,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10. 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 24 states and 30 transitions. Complement of second has 4 states. [2025-03-04 15:44:51,977 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:51,978 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:44:51,979 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:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:44:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:44:51,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:51,979 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:51,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:44:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:44:52,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:44:52,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:52,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,058 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,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:52,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:52,075 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,076 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:52,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10 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:52,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 10. 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 39 states and 49 transitions. Complement of second has 12 states. [2025-03-04 15:44:52,131 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:52,132 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:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-04 15:44:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-04 15:44:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-04 15:44:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-04 15:44:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:52,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2025-03-04 15:44:52,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:52,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2025-03-04 15:44:52,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:52,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:52,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2025-03-04 15:44:52,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:52,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-04 15:44:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2025-03-04 15:44:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2025-03-04 15:44:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 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:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-04 15:44:52,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-04 15:44:52,135 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-04 15:44:52,135 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:44:52,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-03-04 15:44:52,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:52,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:52,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:52,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:44:52,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:52,136 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:52,136 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:52,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 18441565, now seen corresponding path program 5 times [2025-03-04 15:44:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376645081] [2025-03-04 15:44:52,136 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-04 15:44:52,145 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:52,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:44:52,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376645081] [2025-03-04 15:44:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376645081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066013739] [2025-03-04 15:44:52,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:52,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:52,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:52,232 INFO L229 MonitoredProcess]: Starting monitored process 86 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:52,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-03-04 15:44:52,274 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-04 15:44:52,285 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:52,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:44:52,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:52,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:44:52,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:52,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066013739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:52,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:52,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-04 15:44:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512249162] [2025-03-04 15:44:52,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:52,420 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-03-04 15:44:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397129570] [2025-03-04 15:44:52,421 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:44:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,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:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,426 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,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:52,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:44:52,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:44:52,460 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:52,503 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 15:44:52,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2025-03-04 15:44:52,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:52,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 35 transitions. [2025-03-04 15:44:52,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:52,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:52,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2025-03-04 15:44:52,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:52,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 15:44:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2025-03-04 15:44:52,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 15:44:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 15:44:52,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 15:44:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:44:52,506 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 15:44:52,506 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:44:52,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2025-03-04 15:44:52,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:52,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:52,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:52,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:44:52,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:52,507 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:52,507 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:52,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -435490388, now seen corresponding path program 6 times [2025-03-04 15:44:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94493421] [2025-03-04 15:44:52,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:44:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,511 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-03-04 15:44:52,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:44:52,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-04 15:44:52,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:44:52,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:44:52,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-03-04 15:44:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331717096] [2025-03-04 15:44:52,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,540 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:52,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:52,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:52,543 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,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:52,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:52,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1894434869, now seen corresponding path program 3 times [2025-03-04 15:44:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308582659] [2025-03-04 15:44:52,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:52,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-04 15:44:52,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:52,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:44:52,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:52,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:44:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:52,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:52,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:52,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:53,060 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:53,060 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:53,060 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:53,060 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:53,060 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:53,060 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,060 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:53,061 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:53,061 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration12_Lasso [2025-03-04 15:44:53,061 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:53,061 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:53,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:53,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:53,377 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,380 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:53,381 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:53,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:44:53,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,397 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:53,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,399 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:53,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 15:44:53,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 15:44:53,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,418 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:53,419 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:53,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,435 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:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,437 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:53,437 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:53,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,454 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:53,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,456 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:53,456 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:53,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:44:53,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,477 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:53,477 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:53,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,495 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:53,496 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:53,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,512 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:53,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,514 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:53,514 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:53,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,535 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:53,535 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:53,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:44:53,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-04 15:44:53,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,553 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:53,553 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:53,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:53,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:53,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:53,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,572 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:44:53,572 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:44:53,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:53,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:53,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-04 15:44:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,595 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:44:53,596 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:44:53,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:53,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:53,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:53,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:53,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:53,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:53,612 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:53,617 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:44:53,618 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:44:53,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:53,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:53,619 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:44:53,620 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:44:53,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:53,630 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:53,630 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:53,630 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 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1 Supporting invariants [] [2025-03-04 15:44:53,635 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:44:53,652 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:44:53,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:53,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:53,653 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:53,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:44:53,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:44:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,745 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,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,760 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,760 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:53,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12 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:53,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12. 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 30 states and 37 transitions. Complement of second has 4 states. [2025-03-04 15:44:53,773 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:44:53,773 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:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:44:53,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-04 15:44:53,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:53,773 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:44:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:44:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,853 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:44:53,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,875 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,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,889 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,889 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:53,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12 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:53,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12. 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 30 states and 37 transitions. Complement of second has 4 states. [2025-03-04 15:44:53,902 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:44:53,902 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:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:44:53,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-04 15:44:53,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:53,902 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:53,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:44:53,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:44:53,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:53,983 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,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:53,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:53,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:53,999 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,000 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:54,000 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12 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:54,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 12. 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 46 states and 58 transitions. Complement of second has 14 states. [2025-03-04 15:44:54,069 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:54,069 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:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2025-03-04 15:44:54,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-04 15:44:54,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-04 15:44:54,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 22 letters. Loop has 4 letters. [2025-03-04 15:44:54,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:54,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2025-03-04 15:44:54,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:54,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 41 states and 51 transitions. [2025-03-04 15:44:54,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:54,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:54,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2025-03-04 15:44:54,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:54,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-03-04 15:44:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2025-03-04 15:44:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2025-03-04 15:44:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-04 15:44:54,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-04 15:44:54,073 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-04 15:44:54,073 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:44:54,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2025-03-04 15:44:54,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:54,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:54,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:54,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:44:54,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:54,074 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:54,074 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 514223569, now seen corresponding path program 7 times [2025-03-04 15:44:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809903823] [2025-03-04 15:44:54,074 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:44:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:44:54,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:44:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809903823] [2025-03-04 15:44:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809903823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391055309] [2025-03-04 15:44:54,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:44:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:54,192 INFO L229 MonitoredProcess]: Starting monitored process 100 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,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-03-04 15:44:54,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:44:54,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:44:54,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:54,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:44:54,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391055309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:54,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-04 15:44:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981736839] [2025-03-04 15:44:54,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:54,400 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-03-04 15:44:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478915126] [2025-03-04 15:44:54,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,404 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,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:54,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,405 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,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:54,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:44:54,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:44:54,437 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 14 Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 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:44:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:54,493 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-04 15:44:54,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2025-03-04 15:44:54,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:54,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 35 states and 42 transitions. [2025-03-04 15:44:54,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:54,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:54,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-03-04 15:44:54,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:54,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-04 15:44:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-03-04 15:44:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 15:44:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 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:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-04 15:44:54,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-04 15:44:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:44:54,496 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-04 15:44:54,496 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:44:54,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2025-03-04 15:44:54,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:54,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:54,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:54,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:44:54,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:54,499 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:54,499 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash 362494690, now seen corresponding path program 8 times [2025-03-04 15:44:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031620726] [2025-03-04 15:44:54,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:44:54,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:44:54,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:54,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:44:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:44:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-03-04 15:44:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281574248] [2025-03-04 15:44:54,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:54,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:44:54,536 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:54,536 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:54,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:54,537 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,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 465046401, now seen corresponding path program 4 times [2025-03-04 15:44:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854867998] [2025-03-04 15:44:54,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:54,541 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 TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 15:44:54,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:44:54,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:54,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:54,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:44:54,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:44:54,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:54,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:54,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:55,190 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:55,190 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:55,190 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:55,190 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:55,190 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:55,190 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,190 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:55,190 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:55,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration14_Lasso [2025-03-04 15:44:55,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:55,190 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:55,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:55,465 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:55,466 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,469 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:44:55,470 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:44:55,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,487 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:44:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,489 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:44:55,489 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:44:55,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:44:55,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,507 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:44:55,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,508 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:44:55,509 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:44:55,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:44:55,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:55,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,530 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:44:55,530 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:44:55,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,549 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:44:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,551 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:44:55,552 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:44:55,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,568 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:44:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,569 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:44:55,570 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:44:55,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,588 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:44:55,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,590 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:44:55,591 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:44:55,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,607 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:44:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,609 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:44:55,610 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:44:55,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,626 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:44:55,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,628 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:44:55,628 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:44:55,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,647 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:44:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,649 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:44:55,649 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:44:55,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-04 15:44:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,668 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:44:55,669 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:44:55,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:55,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:55,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:55,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,685 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:44:55,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,687 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:44:55,687 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:44:55,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,707 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:44:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,709 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:44:55,709 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:44:55,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,730 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:44:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,732 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:44:55,732 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:44:55,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,751 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:44:55,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,753 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:44:55,754 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:44:55,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:55,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:55,777 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:44:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,778 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:44:55,779 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:44:55,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:55,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:55,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:55,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:55,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:55,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:55,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:55,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:55,801 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 15:44:55,801 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:44:55,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:55,803 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:44:55,804 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:44:55,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:55,814 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:55,814 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:55,814 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 16)_1 Supporting invariants [] [2025-03-04 15:44:55,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:55,831 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:44:55,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:55,832 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:55,832 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:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:55,864 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:44:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:44:55,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:44:55,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:55,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:55,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:55,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,018 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:56,018 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:44:56,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,036 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 36 states and 44 transitions. Complement of second has 5 states. [2025-03-04 15:44:56,036 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:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:56,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-04 15:44:56,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:56,037 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:44:56,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:44:56,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:56,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:56,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,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:56,185 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:44:56,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 36 states and 44 transitions. Complement of second has 5 states. [2025-03-04 15:44:56,205 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:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:56,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-04 15:44:56,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:56,205 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:56,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:56,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:44:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:44:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,360 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:56,360 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:44:56,361 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,459 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 42 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 67 transitions. Complement of second has 17 states. [2025-03-04 15:44:56,459 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:44:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2025-03-04 15:44:56,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-04 15:44:56,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:56,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-04 15:44:56,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:56,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 27 letters. Loop has 4 letters. [2025-03-04 15:44:56,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:56,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2025-03-04 15:44:56,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:56,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 48 states and 60 transitions. [2025-03-04 15:44:56,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:56,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:56,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 60 transitions. [2025-03-04 15:44:56,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:56,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-04 15:44:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 60 transitions. [2025-03-04 15:44:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-04 15:44:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-04 15:44:56,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-04 15:44:56,463 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-04 15:44:56,463 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:44:56,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2025-03-04 15:44:56,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:56,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:56,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:56,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 15:44:56,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:56,464 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:56,464 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 232991751, now seen corresponding path program 9 times [2025-03-04 15:44:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838269807] [2025-03-04 15:44:56,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:56,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-04 15:44:56,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:44:56,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:44:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:56,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838269807] [2025-03-04 15:44:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838269807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674730771] [2025-03-04 15:44:56,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:56,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:56,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:56,633 INFO L229 MonitoredProcess]: Starting monitored process 118 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:56,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-03-04 15:44:56,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-04 15:44:56,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:44:56,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:44:56,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:56,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:44:56,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:56,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674730771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:56,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-04 15:44:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557105910] [2025-03-04 15:44:56,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:56,894 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:56,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-03-04 15:44:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357097600] [2025-03-04 15:44:56,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:56,897 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:56,897 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:56,897 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:56,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:56,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:56,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:56,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:56,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:56,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:56,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:44:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:44:56,927 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 16 Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 22 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:44:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:56,986 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-03-04 15:44:56,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2025-03-04 15:44:56,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:56,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 41 states and 49 transitions. [2025-03-04 15:44:56,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:44:56,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:44:56,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2025-03-04 15:44:56,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:56,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-04 15:44:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2025-03-04 15:44:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 15:44:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-04 15:44:56,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-04 15:44:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:44:56,992 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-04 15:44:56,993 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:44:56,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2025-03-04 15:44:56,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:56,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:56,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:56,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 15:44:56,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:56,993 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:56,993 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1038672278, now seen corresponding path program 10 times [2025-03-04 15:44:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293322931] [2025-03-04 15:44:56,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:56,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:44:57,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:44:57,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:57,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:44:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:44:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-03-04 15:44:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668148248] [2025-03-04 15:44:57,021 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:44:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,023 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:44:57,023 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:44:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:57,024 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,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1731646773, now seen corresponding path program 5 times [2025-03-04 15:44:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:57,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355570299] [2025-03-04 15:44:57,026 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:57,030 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 6 equivalence classes. [2025-03-04 15:44:57,037 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:44:57,038 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 15:44:57,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:57,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:44:57,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:44:57,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:57,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:57,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:58,082 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:58,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:58,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:58,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:58,082 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:58,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:58,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:58,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration16_Lasso [2025-03-04 15:44:58,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:58,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:58,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:58,385 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:58,385 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,387 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:44:58,387 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:44:58,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,404 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:44:58,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,406 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:44:58,406 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:44:58,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-04 15:44:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,424 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-04 15:44:58,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-04 15:44:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,443 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:44:58,444 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:44:58,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,461 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:44:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,463 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:44:58,464 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:44:58,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,481 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:44:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,482 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:44:58,483 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:44:58,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,493 INFO L402 nArgumentSynthesizer]: A total of 0 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,500 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:44:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,500 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 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:44:58,502 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:44:58,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:44:58,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-03-04 15:44:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,522 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:44:58,522 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:44:58,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,539 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:44:58,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,541 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:44:58,541 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:44:58,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:44:58,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,558 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:44:58,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,561 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:44:58,562 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:44:58,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:58,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:58,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:58,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,579 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:44:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,581 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:44:58,582 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:44:58,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:44:58,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,600 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:44:58,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,602 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:44:58,602 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: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,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,613 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,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,621 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:44:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,623 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:44:58,624 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:44:58,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:58,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,644 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:44:58,645 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:44:58,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:44:58,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,665 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:44:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,667 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:44:58,667 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:44:58,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,686 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:44:58,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,688 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:44:58,697 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:44:58,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,718 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:44:58,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,720 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:44:58,721 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:44:58,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,745 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:44:58,746 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:44:58,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:58,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:58,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:58,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,771 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:44:58,772 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:44:58,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:58,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:58,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:58,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:58,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:58,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:58,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:58,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:58,798 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:44:58,798 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-04 15:44:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:58,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:58,800 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:44:58,802 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:44:58,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:58,814 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:58,814 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:58,814 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 20)_1 Supporting invariants [] [2025-03-04 15:44:58,821 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:44:58,836 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:44:58,837 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:44:58,837 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:44:58,838 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:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:58,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:44:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 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,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 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:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,025 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,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,039 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,040 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:44:59,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 42 states and 51 transitions. Complement of second has 5 states. [2025-03-04 15:44:59,069 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,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:59,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-04 15:44:59,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,069 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:44:59,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:44:59,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,241 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,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,257 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,258 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:44:59,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,275 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 42 states and 51 transitions. Complement of second has 5 states. [2025-03-04 15:44:59,275 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,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:44:59,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-04 15:44:59,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,276 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:44:59,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:44:59,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 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 unsat [2025-03-04 15:44:59,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:44:59,460 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,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:59,474 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,474 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:44:59,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 76 transitions. Complement of second has 19 states. [2025-03-04 15:44:59,595 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:44:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2025-03-04 15:44:59,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-04 15:44:59,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-04 15:44:59,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 32 letters. Loop has 4 letters. [2025-03-04 15:44:59,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:59,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2025-03-04 15:44:59,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:59,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2025-03-04 15:44:59,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:44:59,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:44:59,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2025-03-04 15:44:59,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:59,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-04 15:44:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2025-03-04 15:44:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2025-03-04 15:44:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 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,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-04 15:44:59,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-04 15:44:59,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-04 15:44:59,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 15:44:59,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2025-03-04 15:44:59,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:44:59,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:59,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:59,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 15:44:59,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:44:59,602 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:44:59,603 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:44:59,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1960204475, now seen corresponding path program 11 times [2025-03-04 15:44:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582569611] [2025-03-04 15:44:59,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:59,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 7 equivalence classes. [2025-03-04 15:44:59,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:44:59,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:59,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 15:44:59,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582569611] [2025-03-04 15:44:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582569611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532961772] [2025-03-04 15:44:59,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:59,814 INFO L229 MonitoredProcess]: Starting monitored process 139 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:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-03-04 15:44:59,868 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 7 equivalence classes. [2025-03-04 15:44:59,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:44:59,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 15:44:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:59,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:44:59,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:00,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532961772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:00,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:00,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2025-03-04 15:45:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12947156] [2025-03-04 15:45:00,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:00,107 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:00,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2025-03-04 15:45:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:00,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783682141] [2025-03-04 15:45:00,107 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:00,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,112 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,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:00,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,113 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,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:00,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:45:00,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:45:00,145 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 18 Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:00,242 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2025-03-04 15:45:00,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2025-03-04 15:45:00,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:00,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 47 states and 56 transitions. [2025-03-04 15:45:00,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:00,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:00,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2025-03-04 15:45:00,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:00,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-04 15:45:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2025-03-04 15:45:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 15:45:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 46 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:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-03-04 15:45:00,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-04 15:45:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:45:00,245 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-04 15:45:00,245 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 15:45:00,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 56 transitions. [2025-03-04 15:45:00,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:00,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:00,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:00,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 15:45:00,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:00,250 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:00,250 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1360970892, now seen corresponding path program 12 times [2025-03-04 15:45:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310248082] [2025-03-04 15:45:00,250 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:00,256 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 7 equivalence classes. [2025-03-04 15:45:00,268 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:00,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 15:45:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:00,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:45:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2025-03-04 15:45:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538676308] [2025-03-04 15:45:00,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:00,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,285 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:00,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:00,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:00,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:00,286 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,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:00,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2071997781, now seen corresponding path program 6 times [2025-03-04 15:45:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349206408] [2025-03-04 15:45:00,289 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:00,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 7 equivalence classes. [2025-03-04 15:45:00,336 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:45:00,336 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-04 15:45:00,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:00,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:45:00,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:45:00,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:00,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:00,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:01,913 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:01,913 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:01,913 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:01,913 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:01,913 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:01,913 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:01,913 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:01,913 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:01,913 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration18_Lasso [2025-03-04 15:45:01,913 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:01,913 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:01,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:01,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,185 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,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:02,188 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,423 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:02,424 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:02,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,425 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,426 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,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:02,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,443 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:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,446 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:02,446 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:02,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:02,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,465 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:02,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,467 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:02,467 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:02,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,483 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:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,485 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:02,486 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:02,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,496 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 (143)] 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 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:02,505 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: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,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,516 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,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,523 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:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,525 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:02,526 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:02,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:02,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,544 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:02,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,546 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:02,546 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:02,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,563 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:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,564 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:02,565 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:02,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,582 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:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,584 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:02,584 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:02,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,600 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:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,602 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:02,603 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:02,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:45:02,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,619 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:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,621 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:02,622 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:02,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:45:02,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,638 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:02,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,640 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:02,640 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:02,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,656 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:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,658 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:02,659 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:02,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,675 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:02,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,677 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:02,678 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:02,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,696 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:02,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,698 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:02,699 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:02,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:02,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:02,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:02,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [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,718 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:02,719 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: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,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,739 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:02,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,741 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:02,742 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:02,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,766 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:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,768 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:02,779 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:02,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:02,799 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:02,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,801 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:02,802 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:02,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:02,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:02,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:02,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:02,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:02,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:02,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:02,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:02,824 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:45:02,824 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:45:02,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:02,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:02,826 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:02,827 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:02,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:02,837 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:02,837 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:02,837 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1 Supporting invariants [] [2025-03-04 15:45:02,843 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:02,857 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:45:02,860 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:02,860 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:02,860 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-04 15:45:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:02,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:45:02,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:02,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:02,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:02,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:02,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,106 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,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,126 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,126 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:03,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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 58 transitions. Complement of second has 5 states. [2025-03-04 15:45:03,159 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,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:03,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-04 15:45:03,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,159 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:45:03,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:03,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,402 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,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,420 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,420 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:03,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,453 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:03,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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 58 transitions. Complement of second has 5 states. [2025-03-04 15:45:03,458 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,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:03,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-04 15:45:03,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,459 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:45:03,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:45:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:03,759 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,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:03,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:03,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:03,778 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,779 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:03,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 56 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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 67 states and 85 transitions. Complement of second has 21 states. [2025-03-04 15:45:03,924 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:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2025-03-04 15:45:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-04 15:45:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-04 15:45:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 37 letters. Loop has 4 letters. [2025-03-04 15:45:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:03,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. [2025-03-04 15:45:03,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:03,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 78 transitions. [2025-03-04 15:45:03,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:03,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:03,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2025-03-04 15:45:03,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:03,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-03-04 15:45:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2025-03-04 15:45:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2025-03-04 15:45:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 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,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-04 15:45:03,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 15:45:03,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 15:45:03,928 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-04 15:45:03,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2025-03-04 15:45:03,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:03,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:03,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:03,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 15:45:03,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:03,932 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:03,933 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1674956977, now seen corresponding path program 13 times [2025-03-04 15:45:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410047278] [2025-03-04 15:45:03,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:45:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:45:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 66 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:04,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:04,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410047278] [2025-03-04 15:45:04,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410047278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519613979] [2025-03-04 15:45:04,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:04,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:04,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:04,150 INFO L229 MonitoredProcess]: Starting monitored process 160 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:04,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2025-03-04 15:45:04,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:45:04,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:45:04,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:04,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:45:04,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:04,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519613979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:04,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:04,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-03-04 15:45:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492061153] [2025-03-04 15:45:04,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:04,536 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:04,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2025-03-04 15:45:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053761065] [2025-03-04 15:45:04,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:04,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:04,539 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:04,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:04,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:04,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:04,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:45:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:45:04,568 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. cyclomatic complexity: 20 Second operand has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:04,665 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2025-03-04 15:45:04,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 106 transitions. [2025-03-04 15:45:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:04,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 53 states and 63 transitions. [2025-03-04 15:45:04,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:04,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:04,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2025-03-04 15:45:04,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:04,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 15:45:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2025-03-04 15:45:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 15:45:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 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:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 15:45:04,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 15:45:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:45:04,668 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 15:45:04,668 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-04 15:45:04,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2025-03-04 15:45:04,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:04,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:04,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:04,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-04 15:45:04,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:04,669 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:04,669 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:04,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash -272818304, now seen corresponding path program 14 times [2025-03-04 15:45:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675754767] [2025-03-04 15:45:04,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:04,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:45:04,690 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:04,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:04,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:04,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:04,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:04,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2025-03-04 15:45:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995227766] [2025-03-04 15:45:04,704 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:04,706 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:04,707 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:04,707 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:04,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:04,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash -185384801, now seen corresponding path program 7 times [2025-03-04 15:45:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:04,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042065848] [2025-03-04 15:45:04,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:04,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:45:04,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:45:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:04,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:45:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:45:04,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:04,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:04,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:07,813 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:07,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:07,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:07,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:07,814 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:07,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:07,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:07,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:07,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration20_Lasso [2025-03-04 15:45:07,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:07,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:07,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:07,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:08,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:08,154 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:08,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,156 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:08,157 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:08,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:08,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,176 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:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,178 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:08,179 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:08,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,195 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:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,197 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:08,198 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:08,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,214 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:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,216 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:08,217 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:08,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-03-04 15:45:08,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,236 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:08,236 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:08,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-04 15:45:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,255 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:08,256 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:08,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:45:08,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,273 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:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,275 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:45:08,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-04 15:45:08,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:08,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:08,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:08,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,294 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,295 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,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,314 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,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,316 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,316 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,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:08,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,336 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,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,338 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,339 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,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,360 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,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,362 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,362 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,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:08,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:08,383 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,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,385 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,386 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,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,400 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 (172)] 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 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,408 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,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [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 (173)] Ended with exit code 0 [2025-03-04 15:45:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,427 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 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,430 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,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,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,441 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,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [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,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,450 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,451 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,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,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:08,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:08,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:08,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:08,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:08,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:08,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:08,472 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:45:08,472 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:45:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:08,474 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,474 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,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:08,485 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:08,485 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:08,485 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 28)_1 Supporting invariants [] [2025-03-04 15:45:08,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-03-04 15:45:08,505 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-04 15:45:08,506 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:08,506 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:08,506 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:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:08,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:08,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:08,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:08,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:08,721 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,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,740 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,740 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:08,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:08,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 65 transitions. Complement of second has 5 states. [2025-03-04 15:45:08,760 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,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:08,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:08,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:08,761 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:08,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:08,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:08,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:08,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:08,974 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,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:08,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:08,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:08,990 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,990 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:08,990 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:09,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 65 transitions. Complement of second has 5 states. [2025-03-04 15:45:09,014 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,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:09,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:09,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,014 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:09,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:45:09,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:45:09,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:09,219 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,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,234 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,234 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:09,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:09,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 94 transitions. Complement of second has 23 states. [2025-03-04 15:45:09,397 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:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2025-03-04 15:45:09,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-04 15:45:09,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 44 letters. Loop has 2 letters. [2025-03-04 15:45:09,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 42 letters. Loop has 4 letters. [2025-03-04 15:45:09,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:09,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 94 transitions. [2025-03-04 15:45:09,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:09,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 69 states and 87 transitions. [2025-03-04 15:45:09,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:09,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:09,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2025-03-04 15:45:09,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:09,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-04 15:45:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2025-03-04 15:45:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-03-04 15:45:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 57 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,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-03-04 15:45:09,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-04 15:45:09,400 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-04 15:45:09,400 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-04 15:45:09,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 69 transitions. [2025-03-04 15:45:09,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:09,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:09,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:09,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-04 15:45:09,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:09,405 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:09,405 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2061135451, now seen corresponding path program 15 times [2025-03-04 15:45:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160155720] [2025-03-04 15:45:09,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:09,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 9 equivalence classes. [2025-03-04 15:45:09,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:45:09,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:45:09,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 91 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160155720] [2025-03-04 15:45:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160155720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798576400] [2025-03-04 15:45:09,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:09,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:09,648 INFO L229 MonitoredProcess]: Starting monitored process 177 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,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-03-04 15:45:09,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 9 equivalence classes. [2025-03-04 15:45:09,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:45:09,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:45:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:09,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:45:09,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:09,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798576400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:10,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-03-04 15:45:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453176579] [2025-03-04 15:45:10,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:10,134 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:10,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2025-03-04 15:45:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790260313] [2025-03-04 15:45:10,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,137 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,138 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,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,139 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,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:10,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 15:45:10,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-03-04 15:45:10,166 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. cyclomatic complexity: 22 Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 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,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:10,266 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2025-03-04 15:45:10,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 119 transitions. [2025-03-04 15:45:10,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:10,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 59 states and 70 transitions. [2025-03-04 15:45:10,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:10,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:10,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 70 transitions. [2025-03-04 15:45:10,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:10,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 15:45:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 70 transitions. [2025-03-04 15:45:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 15:45:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 58 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,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-04 15:45:10,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 15:45:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:45:10,273 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-04 15:45:10,273 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-04 15:45:10,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 70 transitions. [2025-03-04 15:45:10,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:10,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:10,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:10,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-04 15:45:10,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:10,273 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:10,273 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:10,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -858117066, now seen corresponding path program 16 times [2025-03-04 15:45:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737253092] [2025-03-04 15:45:10,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-04 15:45:10,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:45:10,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:10,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:45:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:45:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:10,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 18 times [2025-03-04 15:45:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675153195] [2025-03-04 15:45:10,311 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,314 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,314 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:10,314 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:45:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:10,319 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,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:10,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash -16779307, now seen corresponding path program 8 times [2025-03-04 15:45:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725210681] [2025-03-04 15:45:10,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:10,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 15:45:10,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:10,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:10,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:45:10,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:45:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:10,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:13,904 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:13,904 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:13,904 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:13,904 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:13,904 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:13,904 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:13,904 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:13,904 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:13,904 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration22_Lasso [2025-03-04 15:45:13,904 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:13,904 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:13,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:13,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:14,574 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:14,574 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,576 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:14,577 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:14,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:45:14,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-04 15:45:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,596 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:14,596 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:14,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:45:14,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,614 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:14,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,615 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:14,616 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:14,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-04 15:45:14,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,637 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:14,638 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:14,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,655 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:14,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,657 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:14,657 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:14,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,674 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:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,676 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:14,676 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:14,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,694 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:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,696 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:14,696 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:14,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-04 15:45:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,716 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:45:14,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-04 15:45:14,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-03-04 15:45:14,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,736 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:14,736 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:14,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,755 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:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,756 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:14,757 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:14,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,776 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:14,777 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:14,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:14,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,796 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:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,798 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:14,799 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:14,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,817 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:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,819 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:14,820 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:14,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,838 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:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,839 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:14,840 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:14,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,860 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:14,861 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:14,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:14,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:14,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:14,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,878 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:14,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,880 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:14,881 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:14,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,902 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:14,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,903 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:14,904 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:14,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:14,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-03-04 15:45:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,926 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:14,927 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:14,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,947 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:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,949 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:14,950 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:14,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:14,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:14,976 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:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:14,978 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:14,979 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:14,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:14,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:14,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:14,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:14,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:14,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:14,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:14,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,003 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:15,004 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:15,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:15,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,025 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:15,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,026 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:15,027 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:15,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:15,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-03-04 15:45:15,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,053 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/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:15,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:15,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-03-04 15:45:15,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,087 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:15,088 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:15,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:15,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-04 15:45:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,111 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:15,112 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:15,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:15,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:15,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2025-03-04 15:45:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,134 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:15,135 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:15,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:15,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:15,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:15,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:15,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:15,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:15,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:15,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:15,156 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:45:15,156 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:45:15,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:15,158 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:15,158 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:15,159 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:15,169 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:15,169 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:15,169 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-04 15:45:15,174 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:15,192 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-04 15:45:15,195 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:15,195 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:15,195 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-04 15:45:15,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:45:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:45:15,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:15,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:15,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:15,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:15,451 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:15,452 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:15,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:15,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 72 transitions. Complement of second has 5 states. [2025-03-04 15:45:15,476 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:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:15,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-04 15:45:15,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:15,477 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:15,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:45:15,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:45:15,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:15,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:15,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:15,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:15,719 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:15,720 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:15,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:15,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 72 transitions. Complement of second has 5 states. [2025-03-04 15:45:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:15,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-04 15:45:15,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:15,746 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:15,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:15,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:45:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:45:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:15,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:15,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:15,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:16,004 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:16,004 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:16,004 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:16,177 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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 81 states and 103 transitions. Complement of second has 25 states. [2025-03-04 15:45:16,177 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:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 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:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 69 transitions. [2025-03-04 15:45:16,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-04 15:45:16,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:16,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 49 letters. Loop has 2 letters. [2025-03-04 15:45:16,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:16,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 47 letters. Loop has 4 letters. [2025-03-04 15:45:16,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:16,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 103 transitions. [2025-03-04 15:45:16,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:16,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 96 transitions. [2025-03-04 15:45:16,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:16,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:16,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 96 transitions. [2025-03-04 15:45:16,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:16,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 96 transitions. [2025-03-04 15:45:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 96 transitions. [2025-03-04 15:45:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2025-03-04 15:45:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.1875) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 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:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-03-04 15:45:16,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-04 15:45:16,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-04 15:45:16,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-04 15:45:16,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2025-03-04 15:45:16,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:16,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:16,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:16,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-04 15:45:16,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:16,181 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:16,181 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:16,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1054954331, now seen corresponding path program 17 times [2025-03-04 15:45:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:16,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523569310] [2025-03-04 15:45:16,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:16,191 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 10 equivalence classes. [2025-03-04 15:45:16,198 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:45:16,198 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 15:45:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:16,234 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:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 153 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523569310] [2025-03-04 15:45:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523569310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445671907] [2025-03-04 15:45:16,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:16,464 INFO L229 MonitoredProcess]: Starting monitored process 205 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:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Waiting until timeout for monitored process [2025-03-04 15:45:16,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 10 equivalence classes. [2025-03-04 15:45:16,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:45:16,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 15:45:16,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:16,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:45:16,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 153 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:16,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 153 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445671907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:17,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2025-03-04 15:45:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133749111] [2025-03-04 15:45:17,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:17,032 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 19 times [2025-03-04 15:45:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099578754] [2025-03-04 15:45:17,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:17,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:17,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:17,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:17,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:17,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:17,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:17,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:17,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 15:45:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-04 15:45:17,069 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 24 Second operand has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 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:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:17,177 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-03-04 15:45:17,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2025-03-04 15:45:17,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:17,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 65 states and 77 transitions. [2025-03-04 15:45:17,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:17,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:17,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2025-03-04 15:45:17,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:17,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:45:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2025-03-04 15:45:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 15:45:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 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:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-04 15:45:17,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:45:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:45:17,183 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:45:17,183 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-04 15:45:17,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2025-03-04 15:45:17,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:17,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:17,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:17,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-04 15:45:17,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:17,183 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:17,184 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1768663914, now seen corresponding path program 18 times [2025-03-04 15:45:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998744924] [2025-03-04 15:45:17,184 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:17,190 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 10 equivalence classes. [2025-03-04 15:45:17,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:45:17,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-04 15:45:17,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:17,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:45:17,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:45:17,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:17,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 20 times [2025-03-04 15:45:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666397128] [2025-03-04 15:45:17,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:17,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:17,228 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:17,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:17,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:17,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1121027575, now seen corresponding path program 9 times [2025-03-04 15:45:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652703162] [2025-03-04 15:45:17,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:17,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 10 equivalence classes. [2025-03-04 15:45:17,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:45:17,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:45:17,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:17,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:45:17,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:45:17,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:17,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:17,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:22,315 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:22,315 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:22,315 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:22,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:22,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:22,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:22,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:22,315 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:22,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration24_Lasso [2025-03-04 15:45:22,315 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:22,315 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:22,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:22,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:23,109 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:23,109 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:23,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,111 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:23,112 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:23,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:23,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:23,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:23,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:23,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,137 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:23,137 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:23,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:23,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,159 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:23,160 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:23,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:23,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:23,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:23,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:23,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,179 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:23,180 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:23,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:23,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:23,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:23,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:23,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,196 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:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,198 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:23,199 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:23,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:23,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:23,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:23,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:23,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:23,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,218 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:23,218 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:23,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:23,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:23,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:23,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,235 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:23,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,237 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:23,238 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:23,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:23,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,261 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:23,261 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:23,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,282 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:23,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,284 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:23,284 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:23,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:23,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2025-03-04 15:45:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,308 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:23,308 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:23,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:23,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-03-04 15:45:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,331 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:23,332 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:23,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:23,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,353 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:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,355 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:23,355 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:23,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:23,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,376 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:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,378 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:23,379 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:23,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,399 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:23,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,401 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:23,402 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:23,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:23,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:23,422 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:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,423 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:23,424 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:23,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:23,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:23,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:23,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:23,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:23,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:23,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:23,442 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:23,447 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:45:23,447 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-04 15:45:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:23,449 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:23,449 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:23,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:23,460 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:23,460 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:23,460 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1 Supporting invariants [] [2025-03-04 15:45:23,466 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:23,485 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 15:45:23,487 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:23,487 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:23,488 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-04 15:45:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:45:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:45:23,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:45:23,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:23,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:23,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:23,768 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:23,768 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:23,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:23,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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 79 transitions. Complement of second has 5 states. [2025-03-04 15:45:23,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:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:23,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-04 15:45:23,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:23,803 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:23,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:45:23,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:45:23,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:23,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:23,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:45:23,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:24,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:24,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:24,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,079 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:24,079 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:24,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:24,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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 79 transitions. Complement of second has 5 states. [2025-03-04 15:45:24,108 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:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-04 15:45:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,109 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:45:24,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:45:24,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:45:24,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,334 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:24,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:24,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:24,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:24,417 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:24,417 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:24,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:24,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 77 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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 88 states and 112 transitions. Complement of second has 27 states. [2025-03-04 15:45:24,637 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:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 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:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2025-03-04 15:45:24,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-04 15:45:24,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 54 letters. Loop has 2 letters. [2025-03-04 15:45:24,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 52 letters. Loop has 4 letters. [2025-03-04 15:45:24,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:24,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 112 transitions. [2025-03-04 15:45:24,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:24,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 83 states and 105 transitions. [2025-03-04 15:45:24,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:24,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:24,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2025-03-04 15:45:24,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:24,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-03-04 15:45:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2025-03-04 15:45:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2025-03-04 15:45:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 69 states have internal predecessors, (83), 0 states have call successors, (0), 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:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-04 15:45:24,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-04 15:45:24,640 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-04 15:45:24,640 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-04 15:45:24,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 83 transitions. [2025-03-04 15:45:24,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:24,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:24,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:24,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 15:45:24,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:24,641 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:24,641 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash 729290895, now seen corresponding path program 19 times [2025-03-04 15:45:24,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:24,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808066751] [2025-03-04 15:45:24,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:24,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:24,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:24,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 153 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808066751] [2025-03-04 15:45:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808066751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387412635] [2025-03-04 15:45:24,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:45:24,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:24,949 INFO L229 MonitoredProcess]: Starting monitored process 222 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:24,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Waiting until timeout for monitored process [2025-03-04 15:45:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:45:25,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:45:25,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:25,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:45:25,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 190 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:25,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 190 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387412635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:25,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-04 15:45:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883148239] [2025-03-04 15:45:25,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:25,535 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:25,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 21 times [2025-03-04 15:45:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487786371] [2025-03-04 15:45:25,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:25,538 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:25,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:25,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:25,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:25,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:25,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 15:45:25,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 15:45:25,573 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. cyclomatic complexity: 26 Second operand has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 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:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:25,742 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-03-04 15:45:25,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 145 transitions. [2025-03-04 15:45:25,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:25,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 71 states and 84 transitions. [2025-03-04 15:45:25,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:25,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:25,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 84 transitions. [2025-03-04 15:45:25,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:25,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-04 15:45:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 84 transitions. [2025-03-04 15:45:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 15:45:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 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:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2025-03-04 15:45:25,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-04 15:45:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:45:25,747 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-04 15:45:25,747 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-04 15:45:25,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 84 transitions. [2025-03-04 15:45:25,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:25,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:25,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:25,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 15:45:25,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:25,748 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:25,748 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:25,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1262318048, now seen corresponding path program 20 times [2025-03-04 15:45:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549845355] [2025-03-04 15:45:25,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-04 15:45:25,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:45:25,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:45:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:45:25,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 22 times [2025-03-04 15:45:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564887111] [2025-03-04 15:45:25,781 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,783 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:45:25,784 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:25,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:25,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:25,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:25,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:25,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1906866943, now seen corresponding path program 10 times [2025-03-04 15:45:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:25,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165311742] [2025-03-04 15:45:25,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:25,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-04 15:45:25,807 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:45:25,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:45:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:45:25,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:25,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:25,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:39,609 WARN L286 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 360 DAG size of output: 269 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:45:40,527 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:40,527 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:40,527 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:40,527 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:40,527 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:40,527 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:40,527 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:40,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:40,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration26_Lasso [2025-03-04 15:45:40,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:40,527 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:40,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:40,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:44,695 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:44,695 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:44,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,697 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:44,697 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:44,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:45:44,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2025-03-04 15:45:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,717 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:44,717 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:44,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,734 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:44,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,736 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:44,737 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:44,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:44,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:44,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:44,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:44,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,756 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:44,757 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:44,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,774 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:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,775 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:44,776 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:44,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:44,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,793 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:44,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,794 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:44,795 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:44,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,811 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:44,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,813 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:44,814 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:44,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:44,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,830 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:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,831 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:44,832 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:44,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,848 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:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,850 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/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:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2025-03-04 15:45:44,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2025-03-04 15:45:44,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,869 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:44,870 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:44,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,886 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:44,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,888 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:44,888 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:44,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2025-03-04 15:45:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,905 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:44,906 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:44,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:45:44,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:44,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:44,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,923 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:44,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,925 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:44,926 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:44,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:44,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,944 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:44,945 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:44,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:44,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:44,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,964 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:44,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,966 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:44,966 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:44,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:44,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2025-03-04 15:45:44,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:44,985 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:44,986 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:44,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:44,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:44,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:44,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:44,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:44,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:44,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:44,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:44,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,002 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:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,004 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:45,005 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:45,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:45,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:45,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:45,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Ended with exit code 0 [2025-03-04 15:45:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,023 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:45,024 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:45,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:45,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:45,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:45,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:45,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,040 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:45,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,042 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:45,043 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:45,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:45,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:45,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:45,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,060 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:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,062 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:45,062 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:45,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:45,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:45,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:45,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:45,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,083 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:45,083 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:45,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:45,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:45,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:45,105 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:45,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,107 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:45,108 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:45,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:45,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:45,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:45,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:45,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:45,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:45,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:45,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:45,131 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:45:45,131 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-04 15:45:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:45,134 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:45,135 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:45,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:45,145 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:45,146 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:45,146 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-04 15:45:45,151 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:45,232 INFO L156 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2025-03-04 15:45:45,234 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:45:45,234 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:45:45,235 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-04 15:45:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:45,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:45:45,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:45:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:45,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:45,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:45,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:45,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:45,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:45,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:45,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:45,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:45,532 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:45,532 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-04 15:45:45,532 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:45,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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 86 transitions. Complement of second has 5 states. [2025-03-04 15:45:45,561 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:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:45,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-04 15:45:45,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:45,562 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:45,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:45:45,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:45:45,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:45,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:45,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:45,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:45,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:45,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:45,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:45,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:45,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:45,876 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:45,877 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-04 15:45:45,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:45,904 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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 86 transitions. Complement of second has 5 states. [2025-03-04 15:45:45,904 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:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:45:45,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-04 15:45:45,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:45,905 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:45:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:45,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:45:45,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:45:45,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:45,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:45,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:45:45,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:45,985 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:46,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:46,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:45:46,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:46,255 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:46,255 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-04 15:45:46,255 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:46,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 84 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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 95 states and 121 transitions. Complement of second has 29 states. [2025-03-04 15:45:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-04 15:45:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 81 transitions. [2025-03-04 15:45:46,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-04 15:45:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:46,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 59 letters. Loop has 2 letters. [2025-03-04 15:45:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:46,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 57 letters. Loop has 4 letters. [2025-03-04 15:45:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:46,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 121 transitions. [2025-03-04 15:45:46,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:46,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 90 states and 114 transitions. [2025-03-04 15:45:46,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:46,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:45:46,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 114 transitions. [2025-03-04 15:45:46,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:46,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-03-04 15:45:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 114 transitions. [2025-03-04 15:45:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2025-03-04 15:45:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 75 states have internal predecessors, (90), 0 states have call successors, (0), 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:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-04 15:45:46,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 15:45:46,527 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 15:45:46,527 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-04 15:45:46,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 90 transitions. [2025-03-04 15:45:46,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:46,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:46,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:46,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 15:45:46,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:46,528 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:46,528 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1451903995, now seen corresponding path program 21 times [2025-03-04 15:45:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889656931] [2025-03-04 15:45:46,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:46,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 12 equivalence classes. [2025-03-04 15:45:46,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:45:46,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:45:46,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 190 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889656931] [2025-03-04 15:45:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889656931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244203717] [2025-03-04 15:45:46,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:46,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:46,908 INFO L229 MonitoredProcess]: Starting monitored process 246 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:46,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (246)] Waiting until timeout for monitored process [2025-03-04 15:45:47,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 12 equivalence classes. [2025-03-04 15:45:47,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:45:47,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:45:47,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:47,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:45:47,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 231 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:47,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 231 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:45:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244203717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:47,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:47,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-03-04 15:45:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946214513] [2025-03-04 15:45:47,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:47,691 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 23 times [2025-03-04 15:45:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092850234] [2025-03-04 15:45:47,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:47,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:47,694 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:47,694 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:47,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:47,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:47,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:47,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 15:45:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 15:45:47,731 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. cyclomatic complexity: 28 Second operand has 40 states, 39 states have (on average 2.923076923076923) internal successors, (114), 40 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:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:47,913 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2025-03-04 15:45:47,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 158 transitions. [2025-03-04 15:45:47,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:47,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 77 states and 91 transitions. [2025-03-04 15:45:47,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:47,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:47,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2025-03-04 15:45:47,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:45:47,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-04 15:45:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2025-03-04 15:45:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 15:45:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 76 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:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2025-03-04 15:45:47,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-04 15:45:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:45:47,915 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-04 15:45:47,915 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-04 15:45:47,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 91 transitions. [2025-03-04 15:45:47,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:47,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:47,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:47,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 15:45:47,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:47,916 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:45:47,916 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:45:47,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 106464596, now seen corresponding path program 22 times [2025-03-04 15:45:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689800891] [2025-03-04 15:45:47,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:45:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:47,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:45:47,943 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:45:47,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:45:47,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:47,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:45:47,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:45:47,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:47,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:47,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 24 times [2025-03-04 15:45:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798040057] [2025-03-04 15:45:47,959 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:45:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:47,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:47,966 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:47,966 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:45:47,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:47,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:47,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:47,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:47,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:47,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -766738061, now seen corresponding path program 11 times [2025-03-04 15:45:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212536002] [2025-03-04 15:45:47,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:45:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:47,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 12 equivalence classes. [2025-03-04 15:45:47,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:45:47,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-04 15:45:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:47,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:47,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 15:45:48,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:45:48,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:48,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:48,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:59,231 WARN L286 SmtUtils]: Spent 11.18s on a formula simplification. DAG size of input: 388 DAG size of output: 286 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:45:59,439 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:59,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:59,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:59,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:59,439 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:59,439 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:59,439 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:59,439 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:59,439 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration28_Lasso [2025-03-04 15:45:59,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:59,439 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:59,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:59,976 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:59,976 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:59,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:59,985 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/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:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2025-03-04 15:46:00,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,045 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:46:00,046 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:46:00,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2025-03-04 15:46:00,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,065 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:46:00,067 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:46:00,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,083 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:46:00,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,085 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:46:00,086 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:46:00,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:00,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2025-03-04 15:46:00,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,104 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:46:00,105 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:46:00,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,122 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:46:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,124 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:46:00,125 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:46:00,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:46:00,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,143 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:46:00,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,145 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:46:00,146 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:46:00,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,162 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:46:00,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,164 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:46:00,165 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:46:00,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2025-03-04 15:46:00,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,184 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:46:00,185 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:46:00,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,202 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:46:00,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,204 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:46:00,205 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:46:00,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:00,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,224 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:46:00,225 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:46:00,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2025-03-04 15:46:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,244 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:46:00,244 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:46:00,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,262 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:46:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,264 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:46:00,264 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:46:00,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2025-03-04 15:46:00,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,286 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:46:00,286 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:46:00,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:46:00,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,303 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:46:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,305 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:46:00,305 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:46:00,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:00,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:00,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:00,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,322 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:46:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,324 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:46:00,325 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:46:00,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,345 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:46:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,347 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:46:00,348 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:46:00,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,373 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:46:00,373 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:46:00,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,396 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:46:00,396 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:46:00,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,415 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:46:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,417 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:46:00,417 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:46:00,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:00,436 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:46:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,438 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:46:00,439 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:46:00,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number 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:00,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:00,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:00,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:00,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:00,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:46:00,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:46:00,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:00,460 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-04 15:46:00,460 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:46:00,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:00,462 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:46:00,463 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:46:00,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:00,473 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:46:00,473 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:00,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 44)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 44)_1 Supporting invariants [] [2025-03-04 15:46:00,479 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:46:00,501 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-03-04 15:46:00,503 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:46:00,503 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:46:00,503 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:00,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:00,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:46:00,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:46:00,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:00,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:46:00,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:00,773 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:46:00,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:00,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:00,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:00,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:00,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:00,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:00,847 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:00,848 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-04 15:46:00,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:00,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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) Result 78 states and 93 transitions. Complement of second has 5 states. [2025-03-04 15:46:00,870 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:46:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:46:00,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-04 15:46:00,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:00,871 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:46:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:00,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:46:00,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:46:00,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:00,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:00,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:46:00,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:01,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:01,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:01,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:01,221 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:01,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-04 15:46:01,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:01,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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) Result 78 states and 93 transitions. Complement of second has 5 states. [2025-03-04 15:46:01,247 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:46:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-04 15:46:01,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-04 15:46:01,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:01,248 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:46:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:01,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:46:01,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:46:01,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:01,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:01,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:46:01,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:01,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:01,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:01,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:01,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:46:01,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:01,624 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:01,624 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-03-04 15:46:01,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:01,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 91 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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) Result 102 states and 130 transitions. Complement of second has 31 states. [2025-03-04 15:46:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-04 15:46:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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:46:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2025-03-04 15:46:01,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-04 15:46:01,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:01,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 64 letters. Loop has 2 letters. [2025-03-04 15:46:01,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:01,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 62 letters. Loop has 4 letters. [2025-03-04 15:46:01,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:01,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 130 transitions. [2025-03-04 15:46:01,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:01,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 97 states and 123 transitions. [2025-03-04 15:46:01,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:46:01,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:46:01,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 123 transitions. [2025-03-04 15:46:01,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:01,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 123 transitions. [2025-03-04 15:46:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 123 transitions. [2025-03-04 15:46:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2025-03-04 15:46:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 81 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-03-04 15:46:01,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-03-04 15:46:01,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-03-04 15:46:01,874 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-04 15:46:01,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 97 transitions. [2025-03-04 15:46:01,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:01,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:01,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:01,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-04 15:46:01,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:46:01,874 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:46:01,874 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:46:01,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1899097465, now seen corresponding path program 23 times [2025-03-04 15:46:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387080229] [2025-03-04 15:46:01,875 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:46:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:01,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-04 15:46:01,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 15:46:01,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 15:46:01,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 276 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387080229] [2025-03-04 15:46:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387080229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:46:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816541942] [2025-03-04 15:46:02,240 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:46:02,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:46:02,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:02,242 INFO L229 MonitoredProcess]: Starting monitored process 269 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:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (269)] Waiting until timeout for monitored process [2025-03-04 15:46:02,351 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-04 15:46:02,405 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 15:46:02,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 15:46:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:02,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:46:02,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 276 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:02,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:46:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 276 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816541942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:46:02,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:46:02,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2025-03-04 15:46:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355062428] [2025-03-04 15:46:02,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:46:02,993 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:02,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 25 times [2025-03-04 15:46:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:02,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012357975] [2025-03-04 15:46:02,993 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:46:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:02,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:02,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:02,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:02,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:02,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:02,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:02,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:02,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:03,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 15:46:03,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 15:46:03,026 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. cyclomatic complexity: 30 Second operand has 41 states, 40 states have (on average 2.9) internal successors, (116), 41 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:03,183 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2025-03-04 15:46:03,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 171 transitions. [2025-03-04 15:46:03,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:03,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 83 states and 98 transitions. [2025-03-04 15:46:03,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:46:03,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:46:03,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 98 transitions. [2025-03-04 15:46:03,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:03,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-04 15:46:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 98 transitions. [2025-03-04 15:46:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 15:46:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.180722891566265) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 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:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-03-04 15:46:03,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-04 15:46:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:46:03,186 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-04 15:46:03,186 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-04 15:46:03,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 98 transitions. [2025-03-04 15:46:03,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:46:03,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:03,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:03,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-04 15:46:03,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:46:03,187 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#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_#res#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~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~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_~res~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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#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;" "test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-04 15:46:03,187 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(test_fun_#t~post4#1 - 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_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-04 15:46:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -46623350, now seen corresponding path program 24 times [2025-03-04 15:46:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260402278] [2025-03-04 15:46:03,188 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:46:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:03,195 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 13 equivalence classes. [2025-03-04 15:46:03,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 15:46:03,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-04 15:46:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:03,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 15:46:03,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 15:46:03,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 26 times [2025-03-04 15:46:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111459512] [2025-03-04 15:46:03,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:46:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:03,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:03,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:03,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:46:03,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:03,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:46:03,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:46:03,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:03,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1855366103, now seen corresponding path program 12 times [2025-03-04 15:46:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190652361] [2025-03-04 15:46:03,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:46:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:03,270 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 13 equivalence classes. [2025-03-04 15:46:03,301 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 15:46:03,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-04 15:46:03,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 15:46:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 15:46:03,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:03,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:03,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace