./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 06:58:32,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:58:33,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 06:58:33,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:58:33,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:58:33,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:58:33,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:58:33,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:58:33,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:58:33,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:58:33,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:58:33,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:58:33,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:58:33,035 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:58:33,036 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:58:33,036 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:58:33,037 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:58:33,037 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:58:33,037 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:58:33,037 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:58:33,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:58:33,038 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:58:33,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:58:33,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:58:33,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:58:33,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:58:33,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:58:33,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:58:33,039 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:58:33,039 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-09 06:58:33,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:58:33,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:58:33,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:58:33,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:58:33,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:58:33,292 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-09 06:58:34,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8464bc6e3/a674f8ecae2041e1a30452bf4b804e2e/FLAGd2673253d [2025-03-09 06:58:34,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:58:34,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2025-03-09 06:58:34,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8464bc6e3/a674f8ecae2041e1a30452bf4b804e2e/FLAGd2673253d [2025-03-09 06:58:34,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8464bc6e3/a674f8ecae2041e1a30452bf4b804e2e [2025-03-09 06:58:34,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:58:34,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:58:34,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:58:34,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:58:34,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:58:34,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:58:34" (1/1) ... [2025-03-09 06:58:34,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db62278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:34, skipping insertion in model container [2025-03-09 06:58:34,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:58:34" (1/1) ... [2025-03-09 06:58:34,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:58:35,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:58:35,074 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:58:35,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:58:35,130 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:58:35,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35 WrapperNode [2025-03-09 06:58:35,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:58:35,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:58:35,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:58:35,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:58:35,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,162 INFO L138 Inliner]: procedures = 116, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-09 06:58:35,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:58:35,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:58:35,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:58:35,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:58:35,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,183 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-09 06:58:35,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:58:35,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:58:35,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:58:35,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:58:35,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (1/1) ... [2025-03-09 06:58:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:35,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:35,232 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-09 06:58:35,237 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-09 06:58:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:58:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:58:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:58:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:58:35,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:58:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:58:35,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:58:35,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:58:35,415 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-09 06:58:35,415 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:58:35,422 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:58:35,422 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:58:35,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:58:35 BoogieIcfgContainer [2025-03-09 06:58:35,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:58:35,423 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:58:35,423 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:58:35,427 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:58:35,428 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:35,428 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:58:34" (1/3) ... [2025-03-09 06:58:35,429 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@722a8c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:58:35, skipping insertion in model container [2025-03-09 06:58:35,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:35,430 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:35" (2/3) ... [2025-03-09 06:58:35,430 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@722a8c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:58:35, skipping insertion in model container [2025-03-09 06:58:35,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:35,430 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:58:35" (3/3) ... [2025-03-09 06:58:35,431 INFO L363 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2025-03-09 06:58:35,466 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:58:35,467 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:58:35,467 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:58:35,467 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:58:35,468 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:58:35,469 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:58:35,469 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:58:35,469 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:58:35,473 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-09 06:58:35,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:58:35,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:35,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:35,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:58:35,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:35,489 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:58:35,489 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-09 06:58:35,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:58:35,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:35,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:35,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:58:35,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:35,497 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-09 06:58:35,498 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-09 06:58:35,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times [2025-03-09 06:58:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322030349] [2025-03-09 06:58:35,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:35,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:35,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:35,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:35,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:35,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-09 06:58:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374107390] [2025-03-09 06:58:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:35,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:35,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:35,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:35,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:35,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:35,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 45773838, now seen corresponding path program 1 times [2025-03-09 06:58:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363548887] [2025-03-09 06:58:35,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:35,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:58:35,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:58:35,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:58:35,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:58:35,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:35,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:35,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:35,965 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:35,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:35,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:35,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:35,966 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:35,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:35,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:35,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:35,966 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2025-03-09 06:58:35,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:35,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:35,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:36,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:36,302 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,305 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-09 06:58:36,307 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-09 06:58:36,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-09 06:58:36,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:36,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:36,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:36,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:36,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:36,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:36,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:36,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:58:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,345 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-09 06:58:36,347 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-09 06:58:36,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-09 06:58:36,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:36,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:36,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:36,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:36,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:36,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:36,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:36,379 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-09 06:58:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,381 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-09 06:58:36,383 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-09 06:58:36,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:36,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:36,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:36,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:36,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:36,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:36,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:36,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:36,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:36,402 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-09 06:58:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,405 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-09 06:58:36,406 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-09 06:58:36,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:36,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:36,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:36,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:36,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:36,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:36,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:36,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:36,429 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-09 06:58:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,431 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-09 06:58:36,432 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-09 06:58:36,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:36,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:36,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:36,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:36,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:36,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:36,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:36,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:36,488 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:58:36,490 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 06:58:36,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:36,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:36,494 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-09 06:58:36,496 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-09 06:58:36,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:36,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:36,509 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:36,509 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-09 06:58:36,516 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-09 06:58:36,527 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:58:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:36,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:36,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:58:36,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:36,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:36,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:36,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:36,585 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-09 06:58:36,602 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-09 06:58:36,603 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-09 06:58:36,625 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-09 06:58:36,626 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-09 06:58:36,629 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-09 06:58:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-03-09 06:58:36,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-09 06:58:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:36,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-09 06:58:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:36,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:58:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:36,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-09 06:58:36,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 16 transitions. [2025-03-09 06:58:36,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:36,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:36,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-03-09 06:58:36,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:36,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-09 06:58:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-03-09 06:58:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-09 06:58:36,658 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-09 06:58:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-09 06:58:36,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-09 06:58:36,660 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-09 06:58:36,660 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:58:36,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-09 06:58:36,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:36,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:36,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:58:36,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:36,661 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-09 06:58:36,661 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-09 06:58:36,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 45773837, now seen corresponding path program 1 times [2025-03-09 06:58:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707479546] [2025-03-09 06:58:36,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:58:36,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:58:36,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:36,739 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-09 06:58:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707479546] [2025-03-09 06:58:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707479546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:36,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:58:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107835095] [2025-03-09 06:58:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:36,743 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-03-09 06:58:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506974762] [2025-03-09 06:58:36,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:36,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:36,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:36,748 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-09 06:58:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506974762] [2025-03-09 06:58:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506974762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:58:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161181458] [2025-03-09 06:58:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:36,749 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:58:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:36,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:58:36,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:58:36,751 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-09 06:58:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:36,754 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-09 06:58:36,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-09 06:58:36,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-09 06:58:36,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:36,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:58:36,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-09 06:58:36,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:36,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-09 06:58:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-09 06:58:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 06:58:36,756 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-09 06:58:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-09 06:58:36,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-09 06:58:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:58:36,757 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-09 06:58:36,757 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:58:36,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-09 06:58:36,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:36,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:36,757 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:58:36,757 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:58:36,757 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-09 06:58:36,757 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-09 06:58:36,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 45773837, now seen corresponding path program 2 times [2025-03-09 06:58:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-09 06:58:36,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:58:36,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:58:36,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:36,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:36,805 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-09 06:58:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-09 06:58:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129059309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:58:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275257511] [2025-03-09 06:58:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:36,806 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:36,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-03-09 06:58:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323411071] [2025-03-09 06:58:36,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:36,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:36,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:36,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:36,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:36,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:58:36,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:58:36,866 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-09 06:58:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:36,880 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2025-03-09 06:58:36,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2025-03-09 06:58:36,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2025-03-09 06:58:36,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:36,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:58:36,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2025-03-09 06:58:36,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:36,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:58:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2025-03-09 06:58:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 06:58:36,881 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-09 06:58:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-03-09 06:58:36,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:58:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:58:36,883 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-09 06:58:36,883 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:58:36,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2025-03-09 06:58:36,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:58:36,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:36,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:36,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:58:36,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:58:36,885 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-09 06:58:36,885 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-09 06:58:36,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988990, now seen corresponding path program 1 times [2025-03-09 06:58:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054112816] [2025-03-09 06:58:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:58:36,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:58:36,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:36,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:58:36,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:58:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 2 times [2025-03-09 06:58:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908057827] [2025-03-09 06:58:36,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:36,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:36,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:36,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:36,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:36,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:36,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:36,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1405083271, now seen corresponding path program 1 times [2025-03-09 06:58:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615536868] [2025-03-09 06:58:36,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:58:36,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:58:36,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:36,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:58:36,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:58:36,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:36,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:36,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:37,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:37,242 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:37,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:37,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:37,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:37,242 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:37,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:37,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:37,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2025-03-09 06:58:37,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:37,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:37,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:37,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:37,550 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,552 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-09 06:58:37,554 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-09 06:58:37,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,576 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-09 06:58:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,578 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-09 06:58:37,579 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-09 06:58:37,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,597 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-09 06:58:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,600 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-09 06:58:37,602 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-09 06:58:37,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-09 06:58:37,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,622 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-09 06:58:37,622 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-09 06:58:37,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,640 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-09 06:58:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,642 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-09 06:58:37,643 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-09 06:58:37,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,663 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-09 06:58:37,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,668 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-09 06:58:37,670 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-09 06:58:37,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:58:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,695 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-09 06:58:37,696 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-09 06:58:37,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-09 06:58:37,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:58:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,723 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-09 06:58:37,724 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-09 06:58:37,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:37,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,743 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-09 06:58:37,745 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-09 06:58:37,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,772 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-09 06:58:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,774 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-09 06:58:37,775 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-09 06:58:37,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,793 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-09 06:58:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,795 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-09 06:58:37,796 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-09 06:58:37,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:37,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:37,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:37,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:37,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,818 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-09 06:58:37,818 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-09 06:58:37,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,842 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-09 06:58:37,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,844 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-09 06:58:37,845 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-09 06:58:37,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:58:37,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,870 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-09 06:58:37,871 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-09 06:58:37,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:37,892 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-09 06:58:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,895 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-09 06:58:37,896 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-09 06:58:37,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:37,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:37,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:37,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:37,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:37,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:37,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:37,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:37,942 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 06:58:37,942 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 06:58:37,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:37,944 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-09 06:58:37,944 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-09 06:58:37,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:37,955 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:37,955 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:37,955 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-09 06:58:37,961 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-09 06:58:37,970 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:58:37,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:58:37,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:58:37,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:37,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:38,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:58:38,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:38,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:58:38,026 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-09 06:58:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:58:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:38,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:38,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:38,051 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-09 06:58:38,052 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-09 06:58:38,052 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-09 06:58:38,069 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-09 06:58:38,069 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-09 06:58:38,070 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-09 06:58:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:58:38,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-09 06:58:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 06:58:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 8 letters. [2025-03-09 06:58:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-09 06:58:38,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:38,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 19 transitions. [2025-03-09 06:58:38,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:38,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:58:38,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-03-09 06:58:38,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:38,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-09 06:58:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-03-09 06:58:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-09 06:58:38,072 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-09 06:58:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-09 06:58:38,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:58:38,072 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:58:38,072 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:58:38,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-09 06:58:38,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:38,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:38,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:38,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:38,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:38,073 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-09 06:58:38,073 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-09 06:58:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1038985741, now seen corresponding path program 1 times [2025-03-09 06:58:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354739345] [2025-03-09 06:58:38,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:58:38,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:58:38,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:58:38,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:58:38,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:38,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-09 06:58:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124971761] [2025-03-09 06:58:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:38,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:38,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:38,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:38,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:38,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2032884716, now seen corresponding path program 1 times [2025-03-09 06:58:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320445416] [2025-03-09 06:58:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:38,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:58:38,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:58:38,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:38,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:58:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:58:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:38,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:38,383 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:38,383 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:38,383 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:38,383 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:38,383 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:38,383 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,383 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:38,383 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:38,383 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration5_Lasso [2025-03-09 06:58:38,383 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:38,383 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:38,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:38,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:38,653 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,657 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-09 06:58:38,658 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-09 06:58:38,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-09 06:58:38,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:38,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:38,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:38,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,676 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-09 06:58:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,678 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-09 06:58:38,679 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-09 06:58:38,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-09 06:58:38,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:38,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:38,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:38,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,697 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-09 06:58:38,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,699 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-09 06:58:38,701 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-09 06:58:38,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:38,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:38,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:38,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:38,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,718 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-09 06:58:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,720 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-09 06:58:38,721 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-09 06:58:38,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-09 06:58:38,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:38,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:38,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:38,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,741 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-09 06:58:38,742 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-09 06:58:38,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-09 06:58:38,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:38,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:38,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,763 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-09 06:58:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,765 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-09 06:58:38,765 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-09 06:58:38,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:38,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:38,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:38,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:58:38,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,788 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-09 06:58:38,788 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-09 06:58:38,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:38,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:38,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:38,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,812 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-09 06:58:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,814 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-09 06:58:38,815 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-09 06:58:38,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:38,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:38,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:38,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:38,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:58:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,844 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-09 06:58:38,845 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-09 06:58:38,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:38,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:38,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:38,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:38,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:38,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:38,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:38,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:38,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:38,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:58:38,862 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:58:38,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:38,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:38,864 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-09 06:58:38,866 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-09 06:58:38,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:38,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:58:38,867 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:38,867 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-09 06:58:38,873 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-09 06:58:38,878 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:58:38,880 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:38,881 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:38,881 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:58:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:58:38,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:58:38,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:38,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:58:38,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:38,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:58:38,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:38,929 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-09 06:58:38,930 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-09 06:58:38,930 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-09 06:58:38,946 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-09 06:58:38,946 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-09 06:58:38,947 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-09 06:58:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-09 06:58:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-09 06:58:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 06:58:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-09 06:58:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:38,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-03-09 06:58:38,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:38,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2025-03-09 06:58:38,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:38,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:38,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2025-03-09 06:58:38,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:38,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-09 06:58:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2025-03-09 06:58:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-09 06:58:38,949 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-09 06:58:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-09 06:58:38,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:58:38,949 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:58:38,949 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:58:38,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-09 06:58:38,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:38,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:38,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:38,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:38,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:38,950 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-09 06:58:38,950 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-09 06:58:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash -607908430, now seen corresponding path program 2 times [2025-03-09 06:58:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555991817] [2025-03-09 06:58:38,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:38,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:58:38,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:38,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:38,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:39,019 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-09 06:58:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555991817] [2025-03-09 06:58:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555991817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513660680] [2025-03-09 06:58:39,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:39,021 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-09 06:58:39,021 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-09 06:58:39,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:58:39,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:39,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:39,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:39,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:58:39,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:39,093 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-09 06:58:39,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:58:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513660680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:58:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:58:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559515771] [2025-03-09 06:58:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:39,094 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:39,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-09 06:58:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366877520] [2025-03-09 06:58:39,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:39,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:39,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:39,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:39,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:58:39,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:58:39,142 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-09 06:58:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:39,165 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-09 06:58:39,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2025-03-09 06:58:39,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:39,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 20 transitions. [2025-03-09 06:58:39,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:39,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:39,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2025-03-09 06:58:39,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:39,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:58:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2025-03-09 06:58:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 06:58:39,167 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-09 06:58:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-09 06:58:39,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:58:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:58:39,167 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:58:39,167 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:58:39,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-09 06:58:39,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:39,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:39,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:39,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:39,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:39,168 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-09 06:58:39,168 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-09 06:58:39,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1879604403, now seen corresponding path program 1 times [2025-03-09 06:58:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248427010] [2025-03-09 06:58:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:39,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:39,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:39,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:39,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-09 06:58:39,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:39,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248427010] [2025-03-09 06:58:39,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248427010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:39,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506113428] [2025-03-09 06:58:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:39,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-09 06:58:39,233 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-09 06:58:39,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:39,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:39,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:39,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:58:39,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:39,303 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-09 06:58:39,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:39,334 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-09 06:58:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506113428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:39,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:39,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 06:58:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968960916] [2025-03-09 06:58:39,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:39,335 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:39,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-09 06:58:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152255209] [2025-03-09 06:58:39,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:39,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:39,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:39,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:39,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:58:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:58:39,384 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-09 06:58:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:39,426 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-09 06:58:39,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2025-03-09 06:58:39,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:39,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 21 transitions. [2025-03-09 06:58:39,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:39,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:39,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2025-03-09 06:58:39,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:39,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 06:58:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2025-03-09 06:58:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 06:58:39,428 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-09 06:58:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-09 06:58:39,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 06:58:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:58:39,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 06:58:39,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:58:39,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2025-03-09 06:58:39,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:39,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:39,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:39,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:39,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:39,432 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-09 06:58:39,432 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-09 06:58:39,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash -943763518, now seen corresponding path program 2 times [2025-03-09 06:58:39,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951160008] [2025-03-09 06:58:39,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 06:58:39,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:58:39,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:39,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:39,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:58:39,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:58:39,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-09 06:58:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104063736] [2025-03-09 06:58:39,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:39,475 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:58:39,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,477 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:39,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:39,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:39,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash -718641055, now seen corresponding path program 1 times [2025-03-09 06:58:39,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452947784] [2025-03-09 06:58:39,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:39,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:39,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:39,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:39,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:39,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:39,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:39,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:39,799 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:39,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:39,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:39,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:39,799 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:39,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:39,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:39,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:39,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration8_Lasso [2025-03-09 06:58:39,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:39,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:39,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:39,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:40,094 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:40,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:40,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,096 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-09 06:58:40,098 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-09 06:58:40,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,115 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-09 06:58:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,117 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-09 06:58:40,118 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-09 06:58:40,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:58:40,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,136 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-09 06:58:40,138 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-09 06:58:40,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-09 06:58:40,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:58:40,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,157 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-09 06:58:40,158 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-09 06:58:40,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:58:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,177 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-09 06:58:40,178 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-09 06:58:40,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,197 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-09 06:58:40,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,199 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-09 06:58:40,199 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-09 06:58:40,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-09 06:58:40,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,217 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-09 06:58:40,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,219 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-09 06:58:40,220 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-09 06:58:40,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:40,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,239 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-09 06:58:40,240 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-09 06:58:40,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,261 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-09 06:58:40,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,263 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-09 06:58:40,267 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-09 06:58:40,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 06:58:40,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,286 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-09 06:58:40,287 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-09 06:58:40,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 06:58:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,307 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-09 06:58:40,307 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-09 06:58:40,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-09 06:58:40,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,324 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-09 06:58:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,326 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-09 06:58:40,328 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-09 06:58:40,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,344 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-09 06:58:40,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,346 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-09 06:58:40,347 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-09 06:58:40,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,364 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-09 06:58:40,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,366 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-09 06:58:40,367 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-09 06:58:40,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,388 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-09 06:58:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,390 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-09 06:58:40,391 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-09 06:58:40,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,410 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-09 06:58:40,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,412 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-09 06:58:40,413 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-09 06:58:40,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 06:58:40,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,435 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-09 06:58:40,436 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-09 06:58:40,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,454 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-09 06:58:40,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,456 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-09 06:58:40,457 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-09 06:58:40,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-09 06:58:40,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,474 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-09 06:58:40,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,476 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-09 06:58:40,477 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-09 06:58:40,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-09 06:58:40,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:40,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:40,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:40,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:40,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,496 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-09 06:58:40,497 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-09 06:58:40,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,518 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-09 06:58:40,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,520 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-09 06:58:40,520 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-09 06:58:40,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,542 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-09 06:58:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,543 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-09 06:58:40,544 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-09 06:58:40,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:40,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:40,566 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-09 06:58:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,569 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-09 06:58:40,570 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-09 06:58:40,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-09 06:58:40,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:40,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:40,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:40,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:40,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:40,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:40,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:40,594 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:58:40,594 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:58:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:40,596 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-09 06:58:40,597 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-09 06:58:40,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:40,607 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:40,607 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:40,607 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-09 06:58:40,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 06:58:40,622 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-09 06:58:40,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:40,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:40,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-09 06:58:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:40,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:58:40,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:58:40,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:40,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:40,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:40,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:40,741 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-09 06:58:40,742 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-09 06:58:40,742 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-09 06:58:40,769 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-09 06:58:40,769 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-09 06:58:40,770 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-09 06:58:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:40,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:58:40,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:40,770 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:40,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:40,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:58:40,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:58:40,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:40,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:40,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:40,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:58:40,883 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-09 06:58:40,883 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-09 06:58:40,902 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-09 06:58:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:58:40,902 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-09 06:58:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:40,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:58:40,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:40,903 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:40,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:58:40,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:58:40,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:40,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:40,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 06:58:40,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:40,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:40,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:41,012 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-09 06:58:41,012 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-09 06:58:41,013 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-09 06:58:41,078 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-09 06:58:41,078 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-09 06:58:41,079 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-09 06:58:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-03-09 06:58:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:58:41,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-09 06:58:41,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-09 06:58:41,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:41,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2025-03-09 06:58:41,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:41,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 33 transitions. [2025-03-09 06:58:41,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:41,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:41,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2025-03-09 06:58:41,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:41,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-09 06:58:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2025-03-09 06:58:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-09 06:58:41,082 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-09 06:58:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-09 06:58:41,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 06:58:41,082 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 06:58:41,082 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:58:41,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-03-09 06:58:41,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:41,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:41,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:41,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:58:41,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:41,083 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-09 06:58:41,083 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-09 06:58:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 875679975, now seen corresponding path program 3 times [2025-03-09 06:58:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543209469] [2025-03-09 06:58:41,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:41,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-09 06:58:41,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:58:41,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:58:41,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:41,184 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-09 06:58:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543209469] [2025-03-09 06:58:41,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543209469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082672903] [2025-03-09 06:58:41,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:41,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:41,186 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-09 06:58:41,188 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-09 06:58:41,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-09 06:58:41,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:58:41,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:58:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:41,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:58:41,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:41,290 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-09 06:58:41,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:41,331 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-09 06:58:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082672903] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:41,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-09 06:58:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766729681] [2025-03-09 06:58:41,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:41,332 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:41,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-03-09 06:58:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:41,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056064087] [2025-03-09 06:58:41,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:41,336 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:41,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:41,338 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:41,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:41,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:41,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:41,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:41,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:58:41,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:58:41,378 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-09 06:58:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:41,411 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-09 06:58:41,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2025-03-09 06:58:41,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:41,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 28 transitions. [2025-03-09 06:58:41,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:41,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:41,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2025-03-09 06:58:41,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:41,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-09 06:58:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2025-03-09 06:58:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 06:58:41,414 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-09 06:58:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-09 06:58:41,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-09 06:58:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:58:41,416 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-09 06:58:41,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:58:41,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-03-09 06:58:41,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:41,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:41,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:41,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:58:41,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:41,418 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-09 06:58:41,418 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-09 06:58:41,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1717538616, now seen corresponding path program 4 times [2025-03-09 06:58:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530257637] [2025-03-09 06:58:41,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:41,423 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 06:58:41,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:58:41,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:41,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:58:41,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:58:41,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:41,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-03-09 06:58:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:41,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402626074] [2025-03-09 06:58:41,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:58:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:41,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:41,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:41,446 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:58:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:41,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:41,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1287168599, now seen corresponding path program 2 times [2025-03-09 06:58:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138003451] [2025-03-09 06:58:41,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:41,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:58:41,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:41,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:41,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:58:41,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:41,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:41,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:41,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:41,941 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:41,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:41,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:41,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:41,942 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:41,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:41,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:41,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:41,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration10_Lasso [2025-03-09 06:58:41,942 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:41,942 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:41,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:41,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:42,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:42,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:42,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:42,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:42,326 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:42,326 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,329 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-09 06:58:42,330 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-09 06:58:42,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,348 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-09 06:58:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,350 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-09 06:58:42,350 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-09 06:58:42,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-09 06:58:42,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,374 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-09 06:58:42,375 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-09 06:58:42,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 06:58:42,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,394 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-09 06:58:42,394 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-09 06:58:42,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 06:58:42,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,414 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-09 06:58:42,414 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-09 06:58:42,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 06:58:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,434 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-09 06:58:42,434 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-09 06:58:42,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,453 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-09 06:58:42,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,455 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-09 06:58:42,455 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-09 06:58:42,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-09 06:58:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,474 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-09 06:58:42,475 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-09 06:58:42,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:58:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,494 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-09 06:58:42,495 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-09 06:58:42,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,514 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-09 06:58:42,514 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-09 06:58:42,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,534 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-09 06:58:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,536 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-09 06:58:42,536 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-09 06:58:42,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,554 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-09 06:58:42,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,556 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-09 06:58:42,557 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-09 06:58:42,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 06:58:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,576 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-09 06:58:42,577 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-09 06:58:42,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-09 06:58:42,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,594 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-09 06:58:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,596 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-09 06:58:42,597 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-09 06:58:42,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-09 06:58:42,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:58:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,618 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-09 06:58:42,618 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-09 06:58:42,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:42,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,638 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-09 06:58:42,639 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-09 06:58:42,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:42,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:42,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:42,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:58:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,658 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-09 06:58:42,659 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-09 06:58:42,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-09 06:58:42,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,683 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-09 06:58:42,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,685 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-09 06:58:42,687 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-09 06:58:42,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,712 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-09 06:58:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,714 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-09 06:58:42,715 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-09 06:58:42,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,746 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-09 06:58:42,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,748 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-09 06:58:42,749 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-09 06:58:42,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,770 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-09 06:58:42,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,772 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-09 06:58:42,772 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-09 06:58:42,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-09 06:58:42,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,794 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-09 06:58:42,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,796 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-09 06:58:42,796 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-09 06:58:42,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,817 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-09 06:58:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,820 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-09 06:58:42,821 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-09 06:58:42,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-09 06:58:42,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:42,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 06:58:42,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,843 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-09 06:58:42,844 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-09 06:58:42,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:42,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:42,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:42,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:42,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:42,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:42,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:42,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:42,873 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:58:42,873 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:58:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:42,876 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-09 06:58:42,878 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-09 06:58:42,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:42,888 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:42,888 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:42,889 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-09 06:58:42,894 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-09 06:58:42,911 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 06:58:42,912 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:42,912 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:42,912 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:58:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:58:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:58:42,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:42,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:58:42,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:58:43,024 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-09 06:58:43,025 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-09 06:58:43,038 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-09 06:58:43,039 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-09 06:58:43,040 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-09 06:58:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:58:43,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:58:43,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:43,040 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:58:43,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:58:43,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,146 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-09 06:58:43,147 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-09 06:58:43,147 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-09 06:58:43,161 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-09 06:58:43,161 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-09 06:58:43,161 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-09 06:58:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:58:43,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:58:43,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:43,162 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:58:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:58:43,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,278 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-09 06:58:43,279 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-09 06:58:43,279 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-09 06:58:43,337 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-09 06:58:43,337 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-09 06:58:43,338 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-09 06:58:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-09 06:58:43,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:58:43,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:43,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:58:43,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:43,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-09 06:58:43,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:43,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2025-03-09 06:58:43,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:43,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2025-03-09 06:58:43,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:43,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:43,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2025-03-09 06:58:43,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:43,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-09 06:58:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2025-03-09 06:58:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2025-03-09 06:58:43,342 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-09 06:58:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-09 06:58:43,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-09 06:58:43,342 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-09 06:58:43,342 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:58:43,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-03-09 06:58:43,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:43,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:43,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:43,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 06:58:43,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:43,343 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-09 06:58:43,343 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-09 06:58:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 18441565, now seen corresponding path program 5 times [2025-03-09 06:58:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:43,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-09 06:58:43,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:43,348 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-09 06:58:43,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:43,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 06:58:43,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,450 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-09 06:58:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-09 06:58:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281210655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643753348] [2025-03-09 06:58:43,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:43,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:43,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:43,453 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-09 06:58:43,454 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-09 06:58:43,493 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-09 06:58:43,507 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:43,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 06:58:43,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:43,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:58:43,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:43,603 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-09 06:58:43,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:43,659 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-09 06:58:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643753348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:43,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-09 06:58:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347681324] [2025-03-09 06:58:43,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:43,660 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:43,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-03-09 06:58:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451291853] [2025-03-09 06:58:43,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:43,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:43,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:43,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 06:58:43,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:58:43,696 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-09 06:58:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:43,738 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-09 06:58:43,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2025-03-09 06:58:43,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:43,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 35 transitions. [2025-03-09 06:58:43,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:43,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:43,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2025-03-09 06:58:43,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:43,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 06:58:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2025-03-09 06:58:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 06:58:43,742 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-09 06:58:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-09 06:58:43,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 06:58:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:58:43,743 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 06:58:43,743 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:58:43,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2025-03-09 06:58:43,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:43,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:43,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:43,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 06:58:43,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:43,743 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-09 06:58:43,743 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-09 06:58:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -435490388, now seen corresponding path program 6 times [2025-03-09 06:58:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111526621] [2025-03-09 06:58:43,744 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:58:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:43,751 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-03-09 06:58:43,759 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:58:43,759 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 06:58:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:58:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:58:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:43,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-03-09 06:58:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321359180] [2025-03-09 06:58:43,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:43,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:43,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:43,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:43,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1894434869, now seen corresponding path program 3 times [2025-03-09 06:58:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033821712] [2025-03-09 06:58:43,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:43,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-09 06:58:43,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:43,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:58:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:58:43,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:43,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:43,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:43,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:44,323 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:44,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:44,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:44,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:44,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:44,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:44,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:44,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration12_Lasso [2025-03-09 06:58:44,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:44,324 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:44,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:44,666 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:44,666 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:44,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,669 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-09 06:58:44,669 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-09 06:58:44,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,686 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-09 06:58:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,688 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-09 06:58:44,689 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-09 06:58:44,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,706 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-09 06:58:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,708 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-09 06:58:44,708 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-09 06:58:44,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-09 06:58:44,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,728 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-09 06:58:44,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,730 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-09 06:58:44,730 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-09 06:58:44,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,748 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-09 06:58:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,750 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-09 06:58:44,750 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-09 06:58:44,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:44,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:44,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-09 06:58:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,771 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-09 06:58:44,772 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-09 06:58:44,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-09 06:58:44,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-09 06:58:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,791 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-09 06:58:44,792 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-09 06:58:44,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,808 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-09 06:58:44,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,810 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-09 06:58:44,811 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-09 06:58:44,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:44,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:44,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,830 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-09 06:58:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,832 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-09 06:58:44,833 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-09 06:58:44,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,850 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-09 06:58:44,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,852 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-09 06:58:44,853 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-09 06:58:44,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:44,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:44,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:44,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-09 06:58:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,872 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-09 06:58:44,874 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-09 06:58:44,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:44,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:44,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:44,894 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-09 06:58:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,896 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-09 06:58:44,897 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-09 06:58:44,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:44,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:44,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:44,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:44,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:44,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:44,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:44,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:44,920 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:58:44,921 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-09 06:58:44,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:44,924 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-09 06:58:44,924 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-09 06:58:44,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:44,935 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:44,935 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:44,935 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-09 06:58:44,941 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-09 06:58:44,953 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:58:44,954 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:44,955 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:44,955 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:58:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:44,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:58:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:58:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:44,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:58:44,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,059 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-09 06:58:45,059 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-09 06:58:45,059 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-09 06:58:45,078 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-09 06:58:45,079 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-09 06:58:45,080 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-09 06:58:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:58:45,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-09 06:58:45,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:45,080 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:58:45,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:58:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,202 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-09 06:58:45,202 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-09 06:58:45,203 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-09 06:58:45,221 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-09 06:58:45,221 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-09 06:58:45,221 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-09 06:58:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:58:45,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-09 06:58:45,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:45,221 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:58:45,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:58:45,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,323 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-09 06:58:45,323 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-09 06:58:45,323 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-09 06:58:45,386 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-09 06:58:45,386 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-09 06:58:45,387 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-09 06:58:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2025-03-09 06:58:45,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-09 06:58:45,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:45,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-09 06:58:45,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:45,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 22 letters. Loop has 4 letters. [2025-03-09 06:58:45,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:45,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2025-03-09 06:58:45,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:45,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 41 states and 51 transitions. [2025-03-09 06:58:45,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:45,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:45,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2025-03-09 06:58:45,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:45,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-03-09 06:58:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2025-03-09 06:58:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2025-03-09 06:58:45,389 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-09 06:58:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-09 06:58:45,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-09 06:58:45,389 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-09 06:58:45,389 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:58:45,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2025-03-09 06:58:45,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:45,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:45,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:45,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 06:58:45,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:45,390 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-09 06:58:45,390 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-09 06:58:45,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 514223569, now seen corresponding path program 7 times [2025-03-09 06:58:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-09 06:58:45,391 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:45,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:58:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:58:45,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:45,530 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-09 06:58:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-09 06:58:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145653931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494085694] [2025-03-09 06:58:45,530 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:45,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:45,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:45,532 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-09 06:58:45,534 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-09 06:58:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:58:45,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:58:45,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:45,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:58:45,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:45,675 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-09 06:58:45,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:45,729 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-09 06:58:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494085694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:45,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-09 06:58:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000567635] [2025-03-09 06:58:45,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:45,730 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:45,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-03-09 06:58:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901838920] [2025-03-09 06:58:45,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:45,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:45,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:45,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:45,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:58:45,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:58:45,765 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-09 06:58:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:45,833 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-09 06:58:45,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2025-03-09 06:58:45,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:45,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 35 states and 42 transitions. [2025-03-09 06:58:45,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:45,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:45,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-03-09 06:58:45,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:45,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 06:58:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-03-09 06:58:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 06:58:45,835 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-09 06:58:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-09 06:58:45,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 06:58:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:58:45,837 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 06:58:45,837 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:58:45,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2025-03-09 06:58:45,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:45,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:45,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:45,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 06:58:45,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:45,838 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-09 06:58:45,839 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-09 06:58:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 362494690, now seen corresponding path program 8 times [2025-03-09 06:58:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169463738] [2025-03-09 06:58:45,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:45,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 06:58:45,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:58:45,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:45,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:58:45,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:58:45,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-03-09 06:58:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-03-09 06:58:45,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:45,869 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:58:45,873 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,873 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:45,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:45,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 465046401, now seen corresponding path program 4 times [2025-03-09 06:58:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577120525] [2025-03-09 06:58:45,876 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:45,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-09 06:58:45,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:58:45,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:45,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:58:45,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:58:45,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:45,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:45,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:46,530 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:46,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:46,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:46,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:46,531 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:46,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:46,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:46,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration14_Lasso [2025-03-09 06:58:46,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:46,531 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:46,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:46,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:46,829 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:46,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,831 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-09 06:58:46,832 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-09 06:58:46,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-09 06:58:46,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,851 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-09 06:58:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,853 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-09 06:58:46,854 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-09 06:58:46,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,871 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-09 06:58:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,873 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-09 06:58:46,874 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-09 06:58:46,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:46,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:46,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-09 06:58:46,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,895 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-09 06:58:46,896 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-09 06:58:46,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,913 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-09 06:58:46,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,915 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-09 06:58:46,916 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-09 06:58:46,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-09 06:58:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,936 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-09 06:58:46,937 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-09 06:58:46,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:46,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:46,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,955 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-09 06:58:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,957 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-09 06:58:46,958 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-09 06:58:46,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,976 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-09 06:58:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,978 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-09 06:58:46,978 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-09 06:58:46,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:46,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:46,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:46,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:46,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:46,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:46,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:46,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:46,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:46,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:46,998 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-09 06:58:46,999 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-09 06:58:47,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-09 06:58:47,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,020 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-09 06:58:47,021 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-09 06:58:47,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:47,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:47,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:47,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,038 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-09 06:58:47,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,040 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-09 06:58:47,041 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-09 06:58:47,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:47,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:47,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:47,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,058 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-09 06:58:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,061 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-09 06:58:47,061 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-09 06:58:47,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,081 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-09 06:58:47,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,083 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-09 06:58:47,084 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-09 06:58:47,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:47,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,107 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-09 06:58:47,108 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-09 06:58:47,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,128 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-09 06:58:47,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,129 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-09 06:58:47,130 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-09 06:58:47,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:47,153 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-09 06:58:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,155 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-09 06:58:47,155 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-09 06:58:47,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:47,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:47,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:47,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:47,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:47,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:47,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:47,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:47,179 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:58:47,179 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:58:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:47,181 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-09 06:58:47,182 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-09 06:58:47,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:47,192 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:47,192 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:47,193 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-09 06:58:47,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-09 06:58:47,209 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 06:58:47,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:47,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:47,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:58:47,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:47,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:58:47,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:58:47,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:47,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:47,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,409 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-09 06:58:47,410 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-09 06:58:47,410 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-09 06:58:47,428 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-09 06:58:47,428 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-09 06:58:47,428 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-09 06:58:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:47,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-09 06:58:47,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:47,429 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:47,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:47,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:58:47,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:58:47,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:47,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:47,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:47,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,610 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-09 06:58:47,611 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-09 06:58:47,611 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-09 06:58:47,632 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-09 06:58:47,632 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-09 06:58:47,633 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-09 06:58:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-09 06:58:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:47,633 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:47,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:58:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:58:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:47,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:47,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:47,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:47,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:47,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:47,804 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-09 06:58:47,805 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-09 06:58:47,805 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-09 06:58:47,904 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-09 06:58:47,904 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-09 06:58:47,904 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-09 06:58:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2025-03-09 06:58:47,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-09 06:58:47,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:47,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-09 06:58:47,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:47,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 27 letters. Loop has 4 letters. [2025-03-09 06:58:47,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:47,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2025-03-09 06:58:47,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:47,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 48 states and 60 transitions. [2025-03-09 06:58:47,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:47,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:47,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 60 transitions. [2025-03-09 06:58:47,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:47,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-09 06:58:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 60 transitions. [2025-03-09 06:58:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-09 06:58:47,907 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-09 06:58:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-09 06:58:47,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-09 06:58:47,907 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-09 06:58:47,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:58:47,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2025-03-09 06:58:47,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:47,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:47,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:47,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-09 06:58:47,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:47,908 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-09 06:58:47,908 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-09 06:58:47,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 232991751, now seen corresponding path program 9 times [2025-03-09 06:58:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649975224] [2025-03-09 06:58:47,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:47,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-09 06:58:47,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:58:47,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:58:47,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:48,080 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-09 06:58:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649975224] [2025-03-09 06:58:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649975224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687822166] [2025-03-09 06:58:48,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:48,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:48,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:48,083 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-09 06:58:48,084 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-09 06:58:48,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-03-09 06:58:48,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:58:48,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:58:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:48,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:58:48,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:48,281 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-09 06:58:48,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:48,363 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-09 06:58:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687822166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:48,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-09 06:58:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884869165] [2025-03-09 06:58:48,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:48,364 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-03-09 06:58:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605306110] [2025-03-09 06:58:48,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:48,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:48,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:48,374 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:48,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:48,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:48,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:48,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:48,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:48,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:58:48,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:58:48,411 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-09 06:58:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:48,471 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-03-09 06:58:48,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2025-03-09 06:58:48,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:48,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 41 states and 49 transitions. [2025-03-09 06:58:48,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:48,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:48,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2025-03-09 06:58:48,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:48,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-09 06:58:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2025-03-09 06:58:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-09 06:58:48,473 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-09 06:58:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-09 06:58:48,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-09 06:58:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:58:48,476 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-09 06:58:48,476 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:58:48,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2025-03-09 06:58:48,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:48,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:48,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:48,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-09 06:58:48,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:48,477 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-09 06:58:48,477 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-09 06:58:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1038672278, now seen corresponding path program 10 times [2025-03-09 06:58:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629036658] [2025-03-09 06:58:48,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:48,482 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:58:48,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:58:48,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:48,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:48,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:58:48,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:58:48,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:48,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:48,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-03-09 06:58:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235848929] [2025-03-09 06:58:48,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:58:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:48,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:48,511 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:48,511 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:58:48,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:48,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:48,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1731646773, now seen corresponding path program 5 times [2025-03-09 06:58:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100465169] [2025-03-09 06:58:48,514 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:48,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 6 equivalence classes. [2025-03-09 06:58:48,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:58:48,527 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:58:48,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:48,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:58:48,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:58:48,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:48,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:49,637 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:49,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:49,638 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:49,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:49,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:49,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:49,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:49,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:49,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration16_Lasso [2025-03-09 06:58:49,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:49,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:49,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:49,952 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:49,952 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:49,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:49,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:49,953 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-09 06:58:49,954 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-09 06:58:49,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-09 06:58:49,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:49,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:49,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:49,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:49,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:49,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:49,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:49,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:49,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:49,973 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-09 06:58:49,973 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-09 06:58:49,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:49,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:49,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:49,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:49,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:49,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:49,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:49,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:49,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:49,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:49,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:49,992 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-09 06:58:49,993 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-09 06:58:49,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,012 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-09 06:58:50,014 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-09 06:58:50,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,032 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-09 06:58:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,034 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-09 06:58:50,034 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-09 06:58:50,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,051 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-09 06:58:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,053 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-09 06:58:50,054 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-09 06:58:50,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,071 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-09 06:58:50,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,072 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-09 06:58:50,073 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-09 06:58:50,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,090 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-09 06:58:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,092 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-09 06:58:50,092 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-09 06:58:50,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,109 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-09 06:58:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,111 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-09 06:58:50,112 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-09 06:58:50,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-09 06:58:50,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,129 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-09 06:58:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,131 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-09 06:58:50,132 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-09 06:58:50,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:50,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:50,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:50,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-09 06:58:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,153 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-09 06:58:50,153 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-09 06:58:50,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,172 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-09 06:58:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,174 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-09 06:58:50,175 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-09 06:58:50,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-09 06:58:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,196 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-09 06:58:50,197 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-09 06:58:50,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-09 06:58:50,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,218 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-09 06:58:50,218 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-09 06:58:50,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,241 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-09 06:58:50,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,243 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-09 06:58:50,244 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-09 06:58:50,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-09 06:58:50,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:50,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,266 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-09 06:58:50,266 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-09 06:58:50,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,284 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-09 06:58:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,286 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-09 06:58:50,286 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-09 06:58:50,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-09 06:58:50,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-09 06:58:50,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,310 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-09 06:58:50,311 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-09 06:58:50,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:50,332 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-09 06:58:50,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,334 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-09 06:58:50,335 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-09 06:58:50,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:50,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:50,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:50,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:50,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:50,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:50,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:50,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:50,359 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:58:50,359 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:58:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:50,361 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-09 06:58:50,363 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-09 06:58:50,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:50,373 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:50,374 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:50,374 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-09 06:58:50,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:50,395 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:58:50,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:50,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:50,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:58:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:50,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:58:50,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:58:50,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:50,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:50,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:58:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:50,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:50,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:50,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:50,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:50,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:50,617 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-09 06:58:50,618 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-09 06:58:50,618 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-09 06:58:50,641 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-09 06:58:50,641 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-09 06:58:50,642 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-09 06:58:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:50,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-09 06:58:50,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:50,642 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:50,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:58:50,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:58:50,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:50,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:58:50,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:50,778 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-09 06:58:50,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:50,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:50,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:50,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:50,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:50,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:50,865 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-09 06:58:50,866 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-09 06:58:50,866 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-09 06:58:50,884 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-09 06:58:50,884 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-09 06:58:50,885 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-09 06:58:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:50,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-09 06:58:50,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:50,885 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:50,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:58:50,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:58:50,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:50,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:50,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:58:50,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:51,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:51,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:51,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:51,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:58:51,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:51,097 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-09 06:58:51,098 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-09 06:58:51,098 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-09 06:58:51,213 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-09 06:58:51,214 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-09 06:58:51,214 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-09 06:58:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2025-03-09 06:58:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-09 06:58:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-09 06:58:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 32 letters. Loop has 4 letters. [2025-03-09 06:58:51,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:51,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2025-03-09 06:58:51,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:51,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2025-03-09 06:58:51,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:51,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:51,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2025-03-09 06:58:51,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:51,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-09 06:58:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2025-03-09 06:58:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2025-03-09 06:58:51,217 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-09 06:58:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-09 06:58:51,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-09 06:58:51,217 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-09 06:58:51,217 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:58:51,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2025-03-09 06:58:51,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:51,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:51,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:51,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-09 06:58:51,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:51,218 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-09 06:58:51,218 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-09 06:58:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1960204475, now seen corresponding path program 11 times [2025-03-09 06:58:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626083824] [2025-03-09 06:58:51,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:51,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 7 equivalence classes. [2025-03-09 06:58:51,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:58:51,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:58:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:51,414 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-09 06:58:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626083824] [2025-03-09 06:58:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626083824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025261468] [2025-03-09 06:58:51,415 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:58:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:51,416 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-09 06:58:51,417 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-09 06:58:51,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 7 equivalence classes. [2025-03-09 06:58:51,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:58:51,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:58:51,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:51,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:58:51,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:51,629 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-09 06:58:51,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:51,720 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-09 06:58:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025261468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:51,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:51,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2025-03-09 06:58:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519911618] [2025-03-09 06:58:51,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:51,721 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2025-03-09 06:58:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749417939] [2025-03-09 06:58:51,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:51,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:51,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:51,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:51,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:51,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:51,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:51,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:58:51,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:58:51,761 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-09 06:58:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:51,860 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2025-03-09 06:58:51,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2025-03-09 06:58:51,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:51,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 47 states and 56 transitions. [2025-03-09 06:58:51,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:51,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:51,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2025-03-09 06:58:51,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:51,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-09 06:58:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2025-03-09 06:58:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-09 06:58:51,863 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-09 06:58:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-03-09 06:58:51,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-09 06:58:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:58:51,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-03-09 06:58:51,864 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:58:51,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 56 transitions. [2025-03-09 06:58:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:51,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:51,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:51,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-09 06:58:51,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:51,864 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-09 06:58:51,864 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-09 06:58:51,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1360970892, now seen corresponding path program 12 times [2025-03-09 06:58:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938044638] [2025-03-09 06:58:51,865 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:58:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:51,870 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 7 equivalence classes. [2025-03-09 06:58:51,889 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:58:51,889 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:58:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:51,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:58:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:58:51,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2025-03-09 06:58:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903203251] [2025-03-09 06:58:51,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:51,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:51,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:51,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:51,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:51,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:51,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2071997781, now seen corresponding path program 6 times [2025-03-09 06:58:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16845783] [2025-03-09 06:58:51,914 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:58:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:51,924 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 7 equivalence classes. [2025-03-09 06:58:51,950 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:58:51,951 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:58:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:51,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:58:51,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:58:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:51,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:53,775 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:53,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:53,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:53,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:53,775 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:53,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:53,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:53,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:53,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration18_Lasso [2025-03-09 06:58:53,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:53,775 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:53,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:53,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:54,312 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:54,312 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,314 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-09 06:58:54,315 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-09 06:58:54,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-09 06:58:54,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-09 06:58:54,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,338 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-09 06:58:54,339 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-09 06:58:54,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,358 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-09 06:58:54,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,360 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-09 06:58:54,361 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-09 06:58:54,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,378 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-09 06:58:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,380 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-09 06:58:54,381 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-09 06:58:54,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,397 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-09 06:58:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,399 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-09 06:58:54,399 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-09 06:58:54,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,417 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-09 06:58:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,419 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-09 06:58:54,419 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-09 06:58:54,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,438 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-09 06:58:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,440 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-09 06:58:54,441 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-09 06:58:54,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,458 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-09 06:58:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,460 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-09 06:58:54,462 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-09 06:58:54,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,484 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-09 06:58:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,486 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-09 06:58:54,487 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-09 06:58:54,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,504 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-09 06:58:54,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,506 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-09 06:58:54,507 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-09 06:58:54,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-09 06:58:54,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,526 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-09 06:58:54,527 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-09 06:58:54,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,543 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-09 06:58:54,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,545 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-09 06:58:54,546 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-09 06:58:54,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-09 06:58:54,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,563 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-09 06:58:54,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,565 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-09 06:58:54,565 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-09 06:58:54,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-09 06:58:54,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,583 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-09 06:58:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,587 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-09 06:58:54,589 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-09 06:58:54,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:54,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,610 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-09 06:58:54,610 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-09 06:58:54,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-09 06:58:54,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:54,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:54,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:54,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-09 06:58:54,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,630 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-09 06:58:54,630 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-09 06:58:54,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,656 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-09 06:58:54,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,658 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-09 06:58:54,659 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-09 06:58:54,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-09 06:58:54,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,684 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-09 06:58:54,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,686 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-09 06:58:54,687 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-09 06:58:54,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:54,708 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-09 06:58:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,710 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-09 06:58:54,710 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-09 06:58:54,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:54,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:54,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:54,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:54,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:54,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:54,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:54,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:54,733 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:58:54,733 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:58:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:54,735 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-09 06:58:54,736 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-09 06:58:54,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:54,747 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:54,747 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:54,747 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-09 06:58:54,753 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-09 06:58:54,767 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:58:54,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:58:54,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:58:54,770 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-09 06:58:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:54,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:58:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:58:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:54,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:58:54,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:54,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:55,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:55,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:55,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:55,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:55,052 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-09 06:58:55,052 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-09 06:58:55,052 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-09 06:58:55,080 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-09 06:58:55,080 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-09 06:58:55,081 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-09 06:58:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:55,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-09 06:58:55,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:55,081 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:55,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:55,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:58:55,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:58:55,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:55,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:58:55,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:55,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:55,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:55,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:55,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:55,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-09 06:58:55,360 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-09 06:58:55,360 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-09 06:58:55,382 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-09 06:58:55,383 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-09 06:58:55,383 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-09 06:58:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:58:55,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-09 06:58:55,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:55,383 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:58:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:58:55,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:58:55,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:55,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:58:55,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:55,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:55,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:55,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:58:55,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:55,677 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-09 06:58:55,678 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-09 06:58:55,678 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-09 06:58:55,841 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-09 06:58:55,842 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-09 06:58:55,842 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-09 06:58:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2025-03-09 06:58:55,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-09 06:58:55,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:55,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-09 06:58:55,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:55,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 57 transitions. Stem has 37 letters. Loop has 4 letters. [2025-03-09 06:58:55,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:55,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. [2025-03-09 06:58:55,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:55,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 78 transitions. [2025-03-09 06:58:55,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:58:55,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:58:55,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2025-03-09 06:58:55,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:55,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-03-09 06:58:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2025-03-09 06:58:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2025-03-09 06:58:55,845 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-09 06:58:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-09 06:58:55,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-09 06:58:55,845 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-09 06:58:55,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:58:55,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2025-03-09 06:58:55,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:55,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:55,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:55,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-09 06:58:55,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:55,847 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-09 06:58:55,847 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-09 06:58:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1674956977, now seen corresponding path program 13 times [2025-03-09 06:58:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237243064] [2025-03-09 06:58:55,848 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:58:55,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:58:55,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:55,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:56,067 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-09 06:58:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237243064] [2025-03-09 06:58:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237243064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399289065] [2025-03-09 06:58:56,068 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:56,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:56,070 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-09 06:58:56,073 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-09 06:58:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:58:56,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:58:56,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:56,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:58:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:56,382 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-09 06:58:56,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:56,515 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-09 06:58:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399289065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:56,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-03-09 06:58:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572901462] [2025-03-09 06:58:56,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:56,516 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:56,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2025-03-09 06:58:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902374248] [2025-03-09 06:58:56,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:56,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:56,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:56,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:56,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:56,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:56,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:56,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:58:56,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:58:56,554 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-09 06:58:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:56,661 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2025-03-09 06:58:56,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 106 transitions. [2025-03-09 06:58:56,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:56,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 53 states and 63 transitions. [2025-03-09 06:58:56,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:58:56,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:58:56,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2025-03-09 06:58:56,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:58:56,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-09 06:58:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2025-03-09 06:58:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 06:58:56,663 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-09 06:58:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-09 06:58:56,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-09 06:58:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:58:56,667 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-09 06:58:56,667 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:58:56,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2025-03-09 06:58:56,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:58:56,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:56,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:56,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-09 06:58:56,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:58:56,668 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-09 06:58:56,668 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-09 06:58:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash -272818304, now seen corresponding path program 14 times [2025-03-09 06:58:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277857631] [2025-03-09 06:58:56,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:56,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:58:56,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:58:56,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,687 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:56,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:58:56,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:58:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2025-03-09 06:58:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623878391] [2025-03-09 06:58:56,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:56,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:58:56,703 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:56,703 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:58:56,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:58:56,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:56,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash -185384801, now seen corresponding path program 7 times [2025-03-09 06:58:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576777735] [2025-03-09 06:58:56,705 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:58:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:56,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:58:56,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:58:56,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:56,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:58:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:58:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:56,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:59,800 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:59,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:59,800 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:59,800 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:59,800 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:59,800 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:59,800 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:59,800 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:59,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration20_Lasso [2025-03-09 06:58:59,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:59,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:59,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:59,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:00,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:59:00,183 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:59:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,185 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-09 06:59:00,186 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-09 06:59: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-09 06:59:00,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,205 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-09 06:59:00,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,207 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-09 06:59:00,208 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-09 06:59:00,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,225 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-09 06:59:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,227 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-09 06:59:00,227 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-09 06:59:00,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,245 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-09 06:59:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,247 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-09 06:59:00,248 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-09 06:59:00,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-09 06:59:00,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,266 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-09 06:59:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,269 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-09 06:59:00,269 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-09 06:59:00,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,287 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-09 06:59:00,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,289 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-09 06:59:00,290 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-09 06:59:00,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,307 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-09 06:59:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,309 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-09 06:59:00,310 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-09 06:59:00,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:00,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:00,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:00,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-09 06:59:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,332 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-09 06:59:00,333 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-09 06:59:00,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-09 06:59:00,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,355 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-09 06:59:00,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,357 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-09 06:59:00,357 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-09 06:59:00,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,377 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-09 06:59:00,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,379 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-09 06:59:00,380 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-09 06:59:00,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,401 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-09 06:59:00,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,403 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-09 06:59:00,404 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-09 06:59:00,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,426 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-09 06:59:00,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,428 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-09 06:59:00,428 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-09 06:59:00,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,448 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-09 06:59:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,450 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-09 06:59:00,450 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-09 06:59:00,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,469 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-09 06:59:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,471 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-09 06:59:00,472 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-09 06:59:00,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:00,492 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-09 06:59:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,494 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-09 06:59:00,495 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-09 06:59:00,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:00,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:00,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:00,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:00,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:00,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:00,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:00,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:59:00,516 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:59:00,517 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:59:00,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:00,518 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-09 06:59:00,519 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-09 06:59:00,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:59:00,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:59:00,531 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:59:00,531 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-09 06:59:00,537 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-09 06:59:00,552 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:59:00,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:59:00,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:59:00,553 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:59:00,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:00,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:59:00,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:59:00,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:00,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:00,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:00,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:00,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:00,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:00,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:00,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:00,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:00,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:00,783 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-09 06:59:00,783 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-09 06:59:00,784 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-09 06:59:00,803 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-09 06:59:00,804 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-09 06:59:00,804 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-09 06:59:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:00,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 06:59:00,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:00,804 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:00,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:00,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:59:00,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:59:00,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:00,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:00,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:01,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-03-09 06:59:01,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:01,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:01,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:01,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:01,158 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-09 06:59:01,158 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-09 06:59:01,159 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-09 06:59:01,178 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-09 06:59:01,179 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-09 06:59:01,179 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-09 06:59:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:01,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 06:59:01,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:01,179 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:01,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:59:01,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:59:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:01,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:01,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:01,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:01,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:01,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:01,418 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-09 06:59:01,419 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-09 06:59:01,419 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-09 06:59:01,579 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-09 06:59:01,579 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-09 06:59:01,579 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-09 06:59:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2025-03-09 06:59:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 06:59:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 44 letters. Loop has 2 letters. [2025-03-09 06:59:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 42 letters. Loop has 4 letters. [2025-03-09 06:59:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:01,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 94 transitions. [2025-03-09 06:59:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:01,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 69 states and 87 transitions. [2025-03-09 06:59:01,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:59:01,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:59:01,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2025-03-09 06:59:01,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:01,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-09 06:59:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2025-03-09 06:59:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-03-09 06:59:01,585 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-09 06:59:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-03-09 06:59:01,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-09 06:59:01,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-03-09 06:59:01,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:59:01,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 69 transitions. [2025-03-09 06:59:01,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:01,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:01,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:01,586 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-09 06:59:01,586 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:01,586 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-09 06:59:01,586 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-09 06:59:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2061135451, now seen corresponding path program 15 times [2025-03-09 06:59:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:01,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162898923] [2025-03-09 06:59:01,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:01,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 9 equivalence classes. [2025-03-09 06:59:01,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 06:59:01,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:59:01,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:01,861 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-09 06:59:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:59:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162898923] [2025-03-09 06:59:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162898923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:59:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900936253] [2025-03-09 06:59:01,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:59:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:01,866 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-09 06:59:01,868 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-09 06:59:01,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 9 equivalence classes. [2025-03-09 06:59:02,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 06:59:02,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:59:02,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:02,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:59:02,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:02,240 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-09 06:59:02,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:59:02,404 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-09 06:59:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900936253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:59:02,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:59:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-03-09 06:59:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118234256] [2025-03-09 06:59:02,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:59:02,405 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:59:02,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2025-03-09 06:59:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:02,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571306667] [2025-03-09 06:59:02,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:02,409 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:02,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:02,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:59:02,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:02,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:02,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:02,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:02,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:59:02,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:59:02,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:59:02,441 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-09 06:59:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:59:02,538 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2025-03-09 06:59:02,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 119 transitions. [2025-03-09 06:59:02,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:02,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 59 states and 70 transitions. [2025-03-09 06:59:02,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:59:02,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:59:02,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 70 transitions. [2025-03-09 06:59:02,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:02,540 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 06:59:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 70 transitions. [2025-03-09 06:59:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 06:59:02,541 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-09 06:59:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-09 06:59:02,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 06:59:02,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 06:59:02,542 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 06:59:02,542 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 06:59:02,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 70 transitions. [2025-03-09 06:59:02,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:02,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:02,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:02,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2025-03-09 06:59:02,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:02,543 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-09 06:59:02,543 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-09 06:59:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -858117066, now seen corresponding path program 16 times [2025-03-09 06:59:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993972950] [2025-03-09 06:59:02,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:59:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:02,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-09 06:59:02,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:59:02,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:59:02,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:02,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:59:02,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:59:02,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:02,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 18 times [2025-03-09 06:59:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358619306] [2025-03-09 06:59:02,577 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:59:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:02,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:02,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:02,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:59:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:02,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:02,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -16779307, now seen corresponding path program 8 times [2025-03-09 06:59:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248085433] [2025-03-09 06:59:02,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:59:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:02,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-09 06:59:02,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:59:02,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:59:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:59:02,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:59:02,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:02,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:06,126 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:59:06,126 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:59:06,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:59:06,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:59:06,126 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:59:06,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:59:06,126 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:59:06,126 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration22_Lasso [2025-03-09 06:59:06,126 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:59:06,126 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:59:06,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:06,842 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:59:06,843 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:59:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,844 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-09 06:59:06,846 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-09 06:59:06,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:06,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:06,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:06,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,863 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-09 06:59:06,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,865 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-09 06:59:06,866 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-09 06:59:06,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:06,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:06,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:06,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:06,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,886 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-09 06:59:06,887 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-09 06:59:06,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:06,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:06,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:06,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,908 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-09 06:59:06,909 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-09 06:59:06,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:06,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:06,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:06,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,927 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-09 06:59:06,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,928 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-09 06:59:06,929 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-09 06:59:06,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:06,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:06,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:06,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,945 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-09 06:59:06,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,947 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-09 06:59:06,948 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-09 06:59:06,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:06,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:06,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:06,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:06,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,968 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-09 06:59:06,969 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-09 06:59:06,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:06,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:06,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:06,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:06,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:06,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:06,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:06,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:06,987 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-09 06:59:06,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:06,989 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-09 06:59:06,990 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-09 06:59:06,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,008 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-09 06:59:07,009 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-09 06:59:07,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,026 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-09 06:59:07,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,028 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-09 06:59:07,029 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-09 06:59:07,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-03-09 06:59:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,051 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-09 06:59:07,052 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-09 06:59:07,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,071 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-09 06:59:07,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,073 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-09 06:59:07,074 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-09 06:59:07,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-03-09 06:59:07,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,094 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-09 06:59:07,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-09 06:59:07,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,115 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-09 06:59:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,117 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-09 06:59:07,117 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-09 06:59:07,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-09 06:59:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,138 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-09 06:59:07,139 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-09 06:59:07,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:07,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:07,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:07,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-09 06:59:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,161 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:59:07,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-09 06:59:07,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:07,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,185 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:59:07,186 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-09 06:59:07,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-09 06:59:07,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,205 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-09 06:59:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,208 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-09 06:59:07,209 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-09 06:59:07,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,230 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-09 06:59:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,232 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-09 06:59:07,232 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-09 06:59:07,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,258 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-09 06:59:07,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,261 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-09 06:59:07,262 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-09 06:59:07,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-09 06:59:07,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-03-09 06:59:07,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,286 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-09 06:59:07,287 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-09 06:59:07,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,314 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-09 06:59:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,316 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-09 06:59:07,317 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-09 06:59:07,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-09 06:59:07,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,344 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-09 06:59:07,345 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-09 06:59:07,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-03-09 06:59:07,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,372 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-09 06:59:07,374 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-09 06:59:07,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-09 06:59:07,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,399 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-09 06:59:07,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,402 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-09 06:59:07,402 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-09 06:59:07,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:07,425 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-09 06:59:07,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,427 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-09 06:59:07,428 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-09 06:59:07,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:07,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:07,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:07,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:07,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:07,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:07,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:07,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:59:07,451 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:59:07,451 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:59:07,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:07,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:07,453 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-09 06:59:07,453 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-09 06:59:07,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:59:07,464 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:59:07,465 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:59:07,465 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-09 06:59:07,471 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-09 06:59:07,491 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:59:07,494 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:59:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:59:07,495 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-09 06:59:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:59:07,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:59:07,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:07,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:07,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:07,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:07,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:07,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:07,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:07,792 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-09 06:59:07,792 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-09 06:59:07,792 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-09 06:59:07,818 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-09 06:59:07,818 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-09 06:59:07,819 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-09 06:59:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:07,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-09 06:59:07,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:07,819 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:07,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:07,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:59:07,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:59:07,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:07,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:07,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:07,999 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-09 06:59:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:08,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:08,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:08,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:08,144 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-09 06:59:08,144 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-09 06:59:08,144 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-09 06:59:08,178 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-09 06:59:08,178 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-09 06:59:08,179 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-09 06:59:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:08,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-09 06:59:08,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:08,179 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:08,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:59:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:59:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:08,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:08,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:08,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:08,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:08,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:08,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:08,508 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-09 06:59:08,508 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-09 06:59:08,508 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-09 06:59:08,689 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-09 06:59:08,689 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-09 06:59:08,689 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-09 06:59:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 69 transitions. [2025-03-09 06:59:08,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-09 06:59:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:08,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 49 letters. Loop has 2 letters. [2025-03-09 06:59:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:08,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 69 transitions. Stem has 47 letters. Loop has 4 letters. [2025-03-09 06:59:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:08,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 103 transitions. [2025-03-09 06:59:08,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:08,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 96 transitions. [2025-03-09 06:59:08,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:59:08,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:59:08,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 96 transitions. [2025-03-09 06:59:08,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:08,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 96 transitions. [2025-03-09 06:59:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 96 transitions. [2025-03-09 06:59:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2025-03-09 06:59:08,692 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-09 06:59:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-03-09 06:59:08,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-09 06:59:08,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-09 06:59:08,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 06:59:08,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2025-03-09 06:59:08,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:08,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:08,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:08,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-09 06:59:08,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:08,693 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-09 06:59:08,694 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-09 06:59:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1054954331, now seen corresponding path program 17 times [2025-03-09 06:59:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650415187] [2025-03-09 06:59:08,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:08,700 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 10 equivalence classes. [2025-03-09 06:59:08,706 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:59:08,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-09 06:59:08,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:08,979 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-09 06:59:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:59:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650415187] [2025-03-09 06:59:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650415187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:59:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051989682] [2025-03-09 06:59:08,980 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:59:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:08,984 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-09 06:59:08,987 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-09 06:59:09,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 10 equivalence classes. [2025-03-09 06:59:09,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:59:09,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-09 06:59:09,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:09,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:59:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:09,418 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-09 06:59:09,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:59:09,592 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-09 06:59:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051989682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:59:09,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:59:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2025-03-09 06:59:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190975009] [2025-03-09 06:59:09,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:59:09,593 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:59:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 19 times [2025-03-09 06:59:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092577905] [2025-03-09 06:59:09,593 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:59:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:09,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:09,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:09,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:09,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:09,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:09,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:59:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 06:59:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-09 06:59:09,645 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-09 06:59:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:59:09,761 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-03-09 06:59:09,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2025-03-09 06:59:09,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:09,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 65 states and 77 transitions. [2025-03-09 06:59:09,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:59:09,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:59:09,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2025-03-09 06:59:09,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:09,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:59:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2025-03-09 06:59:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 06:59:09,765 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-09 06:59:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-09 06:59:09,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:59:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:59:09,766 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-09 06:59:09,766 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 06:59:09,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2025-03-09 06:59:09,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:09,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:09,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:09,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-09 06:59:09,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:09,768 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-09 06:59:09,768 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-09 06:59:09,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1768663914, now seen corresponding path program 18 times [2025-03-09 06:59:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:09,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518051343] [2025-03-09 06:59:09,769 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:59:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:09,776 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 10 equivalence classes. [2025-03-09 06:59:09,789 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:59:09,789 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:59:09,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:09,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:59:09,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:59:09,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:09,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:09,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 20 times [2025-03-09 06:59:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461883440] [2025-03-09 06:59:09,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:59:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:09,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:09,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:09,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:59:09,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:09,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:09,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:09,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:09,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:09,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1121027575, now seen corresponding path program 9 times [2025-03-09 06:59:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525522920] [2025-03-09 06:59:09,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:09,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 10 equivalence classes. [2025-03-09 06:59:09,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:59:09,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-09 06:59:09,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:09,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:59:09,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:59:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:09,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:15,086 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 332 DAG size of output: 246 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:59:15,398 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:59:15,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:59:15,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:59:15,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:59:15,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:59:15,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:15,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:59:15,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:59:15,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration24_Lasso [2025-03-09 06:59:15,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:59:15,399 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:59:15,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:15,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:16,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:59:16,234 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:59:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,236 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-09 06:59:16,237 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-09 06:59:16,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-09 06:59:16,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:16,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:16,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:16,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-09 06:59:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,261 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-09 06:59:16,262 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-09 06:59:16,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,284 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-09 06:59:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,287 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-09 06:59:16,287 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-09 06:59:16,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:16,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:16,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:16,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-09 06:59:16,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,308 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-09 06:59:16,309 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-09 06:59:16,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-09 06:59:16,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:16,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:16,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:16,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,325 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-09 06:59:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,327 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-09 06:59:16,328 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-09 06:59:16,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:16,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:16,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:16,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-09 06:59:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,348 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-09 06:59:16,349 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-09 06:59:16,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:16,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:16,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:16,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,366 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-09 06:59:16,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,368 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-09 06:59:16,369 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-09 06:59:16,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-09 06:59:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,395 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-09 06:59:16,396 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-09 06:59:16,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,417 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-09 06:59:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,419 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-09 06:59:16,419 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-09 06:59:16,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,441 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-09 06:59:16,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,443 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-09 06:59:16,443 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-09 06:59:16,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-09 06:59:16,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,478 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-09 06:59:16,479 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-09 06:59:16,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2025-03-09 06:59:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,502 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-09 06:59:16,503 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-09 06:59:16,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2025-03-09 06:59:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,527 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-09 06:59:16,528 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-09 06:59:16,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,551 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-09 06:59:16,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,554 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-09 06:59:16,555 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-09 06:59:16,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:16,576 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-09 06:59:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,578 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-09 06:59:16,579 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-09 06:59:16,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:16,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:16,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:16,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:16,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:16,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:16,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:16,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:59:16,604 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:59:16,604 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:59:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:16,606 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-09 06:59:16,607 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-09 06:59:16,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:59:16,618 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:59:16,619 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:59:16,619 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-09 06:59:16,625 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-09 06:59:16,646 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 06:59:16,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:59:16,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:59:16,649 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-09 06:59:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:16,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:59:16,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:59:16,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:16,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:16,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:59:16,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:16,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:16,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:16,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:16,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:16,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:16,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:16,942 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-09 06:59:16,942 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-09 06:59:16,942 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-09 06:59:16,970 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-09 06:59:16,970 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-09 06:59:16,970 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-09 06:59:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:16,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:59:16,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:16,971 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:16,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:59:17,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:59:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:17,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:59:17,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:17,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:17,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:17,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:17,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:17,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:17,274 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-09 06:59:17,274 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-09 06:59:17,274 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-09 06:59:17,311 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-09 06:59:17,311 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-09 06:59:17,312 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-09 06:59:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:59:17,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:17,312 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:59:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:59:17,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:17,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:17,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:59:17,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:17,571 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-09 06:59:17,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:17,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:17,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:17,631 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-09 06:59:17,632 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-09 06:59:17,632 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-09 06:59:17,852 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-09 06:59:17,855 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-09 06:59:17,856 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-09 06:59:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2025-03-09 06:59:17,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:59:17,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:17,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 54 letters. Loop has 2 letters. [2025-03-09 06:59:17,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:17,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 75 transitions. Stem has 52 letters. Loop has 4 letters. [2025-03-09 06:59:17,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:17,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 112 transitions. [2025-03-09 06:59:17,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:17,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 83 states and 105 transitions. [2025-03-09 06:59:17,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:59:17,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:59:17,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2025-03-09 06:59:17,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:17,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-03-09 06:59:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2025-03-09 06:59:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2025-03-09 06:59:17,858 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-09 06:59:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-09 06:59:17,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-09 06:59:17,858 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-09 06:59:17,858 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 06:59:17,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 83 transitions. [2025-03-09 06:59:17,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:17,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:17,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:17,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-09 06:59:17,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:17,860 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-09 06:59:17,860 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-09 06:59:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 729290895, now seen corresponding path program 19 times [2025-03-09 06:59:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945949430] [2025-03-09 06:59:17,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:59:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 06:59:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:59:17,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:17,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:18,144 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-09 06:59:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:59:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945949430] [2025-03-09 06:59:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945949430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:59:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070690308] [2025-03-09 06:59:18,145 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:59:18,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:59:18,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:18,147 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-09 06:59:18,148 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-09 06:59:18,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 06:59:18,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:59:18,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:18,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:18,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:59:18,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:18,572 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-09 06:59:18,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:59:18,751 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-09 06:59:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070690308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:59:18,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:59:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-09 06:59:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951164030] [2025-03-09 06:59:18,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:59:18,752 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:59:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 21 times [2025-03-09 06:59:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609381701] [2025-03-09 06:59:18,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:18,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:18,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:18,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:59:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:18,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:18,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:18,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:18,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:18,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:18,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:59:18,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 06:59:18,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 06:59:18,801 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-09 06:59:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:59:18,971 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-03-09 06:59:18,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 145 transitions. [2025-03-09 06:59:18,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:18,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 71 states and 84 transitions. [2025-03-09 06:59:18,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:59:18,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:59:18,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 84 transitions. [2025-03-09 06:59:18,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:18,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-09 06:59:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 84 transitions. [2025-03-09 06:59:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 06:59:18,973 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-09 06:59:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2025-03-09 06:59:18,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-09 06:59:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:59:18,974 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-09 06:59:18,974 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-09 06:59:18,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 84 transitions. [2025-03-09 06:59:18,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:18,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:18,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:18,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-09 06:59:18,975 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:18,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);" "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-09 06:59:18,976 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-09 06:59:18,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1262318048, now seen corresponding path program 20 times [2025-03-09 06:59:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003385398] [2025-03-09 06:59:18,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:59:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:18,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-09 06:59:18,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 06:59:18,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:59:18,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:18,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:18,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 06:59:19,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 06:59:19,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:19,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:19,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 22 times [2025-03-09 06:59:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969474802] [2025-03-09 06:59:19,007 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:59:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:19,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:59:19,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:19,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:59:19,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:19,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:19,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:19,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:19,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:19,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:19,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1906866943, now seen corresponding path program 10 times [2025-03-09 06:59:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759094842] [2025-03-09 06:59:19,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:59:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:19,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-09 06:59:19,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:59:19,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:59:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:19,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:19,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:59:19,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:59:19,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:19,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:33,166 WARN L286 SmtUtils]: Spent 14.09s 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-09 06:59:34,189 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:59:34,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:59:34,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:59:34,189 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:59:34,189 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:59:34,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:34,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:59:34,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:59:34,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration26_Lasso [2025-03-09 06:59:34,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:59:34,189 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:59:34,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:34,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:38,643 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:59:38,643 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:59:38,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,645 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-09 06:59:38,646 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-09 06:59:38,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,665 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-09 06:59:38,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,667 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-09 06:59:38,668 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-09 06:59:38,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-09 06:59:38,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,689 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-09 06:59:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,691 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-09 06:59:38,692 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-09 06:59:38,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:38,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:38,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,711 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-09 06:59:38,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,713 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-09 06:59:38,714 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-09 06:59:38,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,732 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-09 06:59:38,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,734 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-09 06:59:38,734 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-09 06:59:38,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,751 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-09 06:59:38,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,754 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-09 06:59:38,754 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-09 06:59:38,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2025-03-09 06:59:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,773 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-09 06:59:38,774 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-09 06:59:38,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2025-03-09 06:59:38,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,794 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-09 06:59:38,794 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-09 06:59:38,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,812 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-09 06:59:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,814 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-09 06:59:38,815 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-09 06:59:38,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,832 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-09 06:59:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,834 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-09 06:59:38,835 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-09 06:59:38,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:38,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,854 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-09 06:59:38,854 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-09 06:59:38,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,873 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-09 06:59:38,874 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-09 06:59:38,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:38,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:38,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,892 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-09 06:59:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,894 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-09 06:59:38,894 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-09 06:59:38,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2025-03-09 06:59:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,913 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-09 06:59:38,914 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-09 06:59:38,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:38,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:38,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,933 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-09 06:59:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,935 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-09 06:59:38,936 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-09 06:59:38,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:38,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,956 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-09 06:59:38,957 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-09 06:59:38,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:38,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,978 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-09 06:59:38,978 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-09 06:59:38,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:38,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:38,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:38,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:38,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:38,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:38,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:38,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:38,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:38,996 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-09 06:59:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:38,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:38,998 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-09 06:59:38,999 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-09 06:59:39,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:39,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:39,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:39,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:39,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:39,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:39,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:39,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:39,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:39,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2025-03-09 06:59:39,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:39,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:39,018 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-09 06:59:39,019 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-09 06:59:39,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:39,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:39,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:39,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:39,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:39,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:39,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:39,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:39,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:39,036 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-09 06:59:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:39,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:39,039 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-09 06:59:39,039 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-09 06:59:39,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:39,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:39,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:39,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:39,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:39,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:39,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:39,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:39,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2025-03-09 06:59:39,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:39,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:39,061 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-09 06:59:39,062 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-09 06:59:39,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-09 06:59:39,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:39,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:39,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:39,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:39,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:39,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:39,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:39,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:39,089 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-09 06:59:39,089 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-09 06:59:39,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:39,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:39,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:39,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:39,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:39,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:39,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:39,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:59:39,111 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:59:39,111 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-09 06:59:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:39,113 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-09 06:59:39,114 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-09 06:59:39,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:59:39,125 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:59:39,125 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:59:39,125 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-09 06:59:39,131 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-09 06:59:39,231 INFO L156 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2025-03-09 06:59:39,233 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:59:39,233 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:59:39,233 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2025-03-09 06:59:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:39,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 06:59:39,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 06:59:39,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:39,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:39,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:59:39,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:39,518 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-09 06:59:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:39,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:39,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:39,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:39,572 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-09 06:59:39,573 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-09 06:59:39,573 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-09 06:59:39,615 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-09 06:59:39,615 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-09 06:59:39,616 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-09 06:59:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:39,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-09 06:59:39,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:39,616 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:39,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 06:59:39,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 06:59:39,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:39,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:59:39,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:39,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:39,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:39,932 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-09 06:59:39,933 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-09 06:59:39,933 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-09 06:59:39,960 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-09 06:59:39,961 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-09 06:59:39,961 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-09 06:59:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:39,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-09 06:59:39,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:39,961 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:39,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 06:59:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 06:59:40,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:40,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:40,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:59:40,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:40,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:40,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:40,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:59:40,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:40,282 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-09 06:59:40,282 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-09 06:59:40,283 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-09 06:59:40,530 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-09 06:59:40,530 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-09 06:59:40,530 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-09 06:59:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 81 transitions. [2025-03-09 06:59:40,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-09 06:59:40,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:40,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 59 letters. Loop has 2 letters. [2025-03-09 06:59:40,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:40,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 81 transitions. Stem has 57 letters. Loop has 4 letters. [2025-03-09 06:59:40,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:40,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 121 transitions. [2025-03-09 06:59:40,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:40,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 90 states and 114 transitions. [2025-03-09 06:59:40,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:59:40,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:59:40,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 114 transitions. [2025-03-09 06:59:40,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:40,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-03-09 06:59:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 114 transitions. [2025-03-09 06:59:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2025-03-09 06:59:40,533 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-09 06:59:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-09 06:59:40,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-09 06:59:40,533 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-09 06:59:40,533 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-09 06:59:40,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 90 transitions. [2025-03-09 06:59:40,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:40,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:40,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:40,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-09 06:59:40,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:40,534 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-09 06:59:40,534 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-09 06:59:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1451903995, now seen corresponding path program 21 times [2025-03-09 06:59:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136422854] [2025-03-09 06:59:40,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:40,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 12 equivalence classes. [2025-03-09 06:59:40,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:59:40,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 06:59:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:40,923 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-09 06:59:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:59:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136422854] [2025-03-09 06:59:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136422854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:59:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892985980] [2025-03-09 06:59:40,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:59:40,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:59:40,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:40,927 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-09 06:59:40,929 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-09 06:59:41,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 12 equivalence classes. [2025-03-09 06:59:41,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:59:41,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 06:59:41,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:41,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:59:41,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:41,526 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-09 06:59:41,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:59:41,759 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-09 06:59:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892985980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:59:41,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:59:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-03-09 06:59:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882681563] [2025-03-09 06:59:41,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:59:41,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:59:41,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 23 times [2025-03-09 06:59:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898972588] [2025-03-09 06:59:41,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:41,763 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:41,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:41,765 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:59:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:41,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:41,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:41,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:41,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:41,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:41,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:41,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:59:41,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 06:59:41,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 06:59:41,798 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-09 06:59:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:59:41,975 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2025-03-09 06:59:41,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 158 transitions. [2025-03-09 06:59:41,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:41,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 77 states and 91 transitions. [2025-03-09 06:59:41,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:59:41,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:59:41,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 91 transitions. [2025-03-09 06:59:41,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:41,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-09 06:59:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 91 transitions. [2025-03-09 06:59:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 06:59:41,977 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-09 06:59:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2025-03-09 06:59:41,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-09 06:59:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:59:41,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-03-09 06:59:41,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-09 06:59:41,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 91 transitions. [2025-03-09 06:59:41,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:41,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:41,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:41,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-09 06:59:41,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:41,979 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-09 06:59:41,979 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-09 06:59:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 106464596, now seen corresponding path program 22 times [2025-03-09 06:59:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479196845] [2025-03-09 06:59:41,979 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:59:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:41,986 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-09 06:59:42,005 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:59:42,005 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:59:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:42,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:59:42,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:59:42,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:42,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:42,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 24 times [2025-03-09 06:59:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268901190] [2025-03-09 06:59:42,021 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:59:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:42,024 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:42,024 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:42,025 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:59:42,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:42,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:42,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:42,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -766738061, now seen corresponding path program 11 times [2025-03-09 06:59:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994439214] [2025-03-09 06:59:42,028 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:42,037 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 12 equivalence classes. [2025-03-09 06:59:42,052 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 06:59:42,053 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-09 06:59:42,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:42,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 06:59:42,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 06:59:42,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:42,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:53,346 WARN L286 SmtUtils]: Spent 11.24s 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-09 06:59:53,547 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:59:53,547 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:59:53,547 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:59:53,547 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:59:53,547 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:59:53,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:53,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:59:53,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:59:53,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration28_Lasso [2025-03-09 06:59:53,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:59:53,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:59:53,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:53,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:59:54,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:59:54,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:59:54,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,172 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-09 06:59:54,176 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-09 06:59:54,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Ended with exit code 0 [2025-03-09 06:59:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,202 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-09 06:59:54,202 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-09 06:59:54,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,223 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-09 06:59:54,224 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-09 06:59:54,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,243 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-09 06:59:54,244 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-09 06:59:54,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-09 06:59:54,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,262 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-09 06:59:54,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,264 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-09 06:59:54,265 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-09 06:59:54,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-09 06:59:54,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,288 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-09 06:59:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,290 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-09 06:59:54,293 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-09 06:59:54,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,313 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-09 06:59:54,315 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-09 06:59:54,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,333 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-09 06:59:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,336 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-09 06:59:54,337 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-09 06:59:54,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,356 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-09 06:59:54,357 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-09 06:59:54,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2025-03-09 06:59:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,378 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-09 06:59:54,379 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-09 06:59:54,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-09 06:59:54,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,397 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-09 06:59:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,399 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-09 06:59:54,399 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-09 06:59:54,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,417 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-09 06:59:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,419 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-09 06:59:54,420 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-09 06:59:54,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,441 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-09 06:59:54,442 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-09 06:59:54,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,462 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-09 06:59:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,464 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-09 06:59:54,465 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-09 06:59:54,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,484 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-09 06:59:54,485 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-09 06:59:54,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:59:54,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:59:54,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:59:54,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,503 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-09 06:59:54,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,518 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-09 06:59:54,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,533 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-09 06:59:54,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,535 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-09 06:59:54,536 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-09 06:59:54,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2025-03-09 06:59:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,560 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-09 06:59:54,561 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-09 06:59:54,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-09 06:59:54,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,582 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-09 06:59:54,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,584 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-09 06:59:54,584 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-09 06:59:54,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,605 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-09 06:59:54,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,607 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-09 06:59:54,607 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-09 06:59:54,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:59:54,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:54,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,629 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-09 06:59:54,630 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-09 06:59:54,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:59:54,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:59:54,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:59:54,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:59:54,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:59:54,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:59:54,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:59:54,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:59:54,653 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:59:54,653 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:59:54,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:59:54,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:54,655 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-09 06:59:54,656 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-09 06:59:54,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:59:54,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:59:54,667 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:59:54,667 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-09 06:59:54,673 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-09 06:59:54,695 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-03-09 06:59:54,697 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:59:54,697 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:59:54,697 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-09 06:59:54,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:54,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:59:54,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:59:54,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:54,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:54,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:59:54,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:55,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:55,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:55,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:55,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,036 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-09 06:59:55,037 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-09 06:59:55,037 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-09 06:59:55,060 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-09 06:59:55,061 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-09 06:59:55,061 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-09 06:59:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-09 06:59:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:55,061 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:59:55,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:59:55,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:55,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:55,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:59:55,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:55,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:55,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:55,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:55,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:55,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,421 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-09 06:59:55,421 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-09 06:59:55,422 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-09 06:59:55,444 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-09 06:59:55,445 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-09 06:59:55,445 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-09 06:59:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:59:55,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-09 06:59:55,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:55,445 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:59:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 06:59:55,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 06:59:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:55,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:59:55,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Forceful destruction successful, exit code 0 [2025-03-09 06:59:55,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:55,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:59:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:55,817 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-09 06:59:55,818 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-09 06:59:55,818 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-09 06:59:56,091 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-09 06:59:56,092 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-09 06:59:56,092 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-09 06:59:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2025-03-09 06:59:56,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-09 06:59:56,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:56,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 64 letters. Loop has 2 letters. [2025-03-09 06:59:56,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:56,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 62 letters. Loop has 4 letters. [2025-03-09 06:59:56,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:59:56,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 130 transitions. [2025-03-09 06:59:56,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:56,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 97 states and 123 transitions. [2025-03-09 06:59:56,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:59:56,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:59:56,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 123 transitions. [2025-03-09 06:59:56,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:56,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 123 transitions. [2025-03-09 06:59:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 123 transitions. [2025-03-09 06:59:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2025-03-09 06:59:56,094 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-09 06:59:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-03-09 06:59:56,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-03-09 06:59:56,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-03-09 06:59:56,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-09 06:59:56,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 97 transitions. [2025-03-09 06:59:56,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:56,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:56,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:56,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-09 06:59:56,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:56,095 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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-09 06:59:56,095 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 > 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(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-09 06:59:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1899097465, now seen corresponding path program 23 times [2025-03-09 06:59:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:56,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083612830] [2025-03-09 06:59:56,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:56,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-09 06:59:56,110 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:59:56,110 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:59:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:56,457 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-09 06:59:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:59:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083612830] [2025-03-09 06:59:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083612830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:59:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243444870] [2025-03-09 06:59:56,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:59:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:59:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:59:56,459 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-09 06:59:56,460 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-09 06:59:56,562 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-09 06:59:56,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:59:56,613 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:59:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:59:56,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:59:56,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:59:56,948 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-09 06:59:56,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:59:57,174 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-09 06:59:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243444870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:59:57,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:59:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2025-03-09 06:59:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368483700] [2025-03-09 06:59:57,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:59:57,174 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:59:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 25 times [2025-03-09 06:59:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907061243] [2025-03-09 06:59:57,175 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:59:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:57,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:57,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:57,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:59:57,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-09 06:59:57,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 06:59:57,215 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-09 06:59:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:59:57,376 INFO L93 Difference]: Finished difference Result 144 states and 171 transitions. [2025-03-09 06:59:57,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 171 transitions. [2025-03-09 06:59:57,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:57,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 83 states and 98 transitions. [2025-03-09 06:59:57,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:59:57,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:59:57,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 98 transitions. [2025-03-09 06:59:57,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:59:57,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-09 06:59:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 98 transitions. [2025-03-09 06:59:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 06:59:57,379 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-09 06:59:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-03-09 06:59:57,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-09 06:59:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:59:57,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-09 06:59:57,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-09 06:59:57,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 98 transitions. [2025-03-09 06:59:57,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:59:57,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:59:57,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:59:57,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-09 06:59:57,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:59:57,382 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-09 06:59:57,383 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-09 06:59:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -46623350, now seen corresponding path program 24 times [2025-03-09 06:59:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105326836] [2025-03-09 06:59:57,383 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:59:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:57,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 13 equivalence classes. [2025-03-09 06:59:57,417 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 06:59:57,417 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:59:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:57,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 06:59:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 06:59:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:57,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 26 times [2025-03-09 06:59:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876740126] [2025-03-09 06:59:57,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:59:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:57,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:57,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:57,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:59:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:59:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:59:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:59:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:59:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1855366103, now seen corresponding path program 12 times [2025-03-09 06:59:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:59:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585448494] [2025-03-09 06:59:57,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:59:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:59:57,472 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 13 equivalence classes. [2025-03-09 06:59:57,502 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:59:57,502 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:59:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:59:57,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:59:57,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:59:57,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:59:57,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:59:57,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace