./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 0dd810d674c4cff9336e312b19e9358b8b865ab368a2555cf5d277ff73d72d47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:55:30,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:55:30,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:55:30,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:55:30,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:55:30,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:55:30,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:55:30,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:55:30,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:55:30,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:55:30,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:55:30,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:55:30,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:55:30,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:55:30,115 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:55:30,115 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:55:30,115 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:55:30,115 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:55:30,115 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:55:30,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:55:30,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:55:30,117 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:55:30,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:55:30,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:55:30,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:55:30,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:55:30,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:55:30,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:55:30,118 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:55:30,118 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0dd810d674c4cff9336e312b19e9358b8b865ab368a2555cf5d277ff73d72d47 [2025-03-17 19:55:30,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:55:30,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:55:30,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:55:30,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:55:30,324 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:55:30,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i [2025-03-17 19:55:31,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4171306f/135ae989b5fe44c49297b1244731c873/FLAG0a93ff58b [2025-03-17 19:55:31,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:55:31,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i [2025-03-17 19:55:31,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4171306f/135ae989b5fe44c49297b1244731c873/FLAG0a93ff58b [2025-03-17 19:55:31,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4171306f/135ae989b5fe44c49297b1244731c873 [2025-03-17 19:55:31,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:55:31,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:55:31,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:31,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:55:31,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:55:31,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:31" (1/1) ... [2025-03-17 19:55:31,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40eb77c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:31, skipping insertion in model container [2025-03-17 19:55:31,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:55:31" (1/1) ... [2025-03-17 19:55:32,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:55:32,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:32,207 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:55:32,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:55:32,256 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:55:32,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32 WrapperNode [2025-03-17 19:55:32,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:55:32,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:32,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:55:32,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:55:32,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,282 INFO L138 Inliner]: procedures = 110, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-03-17 19:55:32,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:55:32,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:55:32,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:55:32,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:55:32,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,301 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [5, 4, 5]. 36 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 8 writes are split as follows [3, 2, 3]. [2025-03-17 19:55:32,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:55:32,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:55:32,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:55:32,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:55:32,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (1/1) ... [2025-03-17 19:55:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:32,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:32,330 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-17 19:55:32,332 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-17 19:55:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:55:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:55:32,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:55:32,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:55:32,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:55:32,558 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-17 19:55:32,561 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:55:32,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:55:32,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:55:32,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:32 BoogieIcfgContainer [2025-03-17 19:55:32,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:55:32,570 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:55:32,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:55:32,574 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:55:32,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:32,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:55:31" (1/3) ... [2025-03-17 19:55:32,576 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b1d172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:32, skipping insertion in model container [2025-03-17 19:55:32,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:32,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:55:32" (2/3) ... [2025-03-17 19:55:32,576 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b1d172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:55:32, skipping insertion in model container [2025-03-17 19:55:32,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:55:32,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:32" (3/3) ... [2025-03-17 19:55:32,577 INFO L363 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i [2025-03-17 19:55:32,614 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:55:32,614 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:55:32,615 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:55:32,615 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:55:32,615 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:55:32,615 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:55:32,615 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:55:32,616 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:55:32,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) 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-17 19:55:32,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:32,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:32,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:32,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:55:32,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:32,634 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:55:32,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) 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-17 19:55:32,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:32,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:32,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:32,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:55:32,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:32,639 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1, main_#t~short12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~mem17#1, main_#t~mem18#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~d~0#1.base, main_~d~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~d~0#1.base, main_~d~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#2(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#0(main_#t~nondet7#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-03-17 19:55:32,639 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;call main_#t~mem14#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#2(main_#t~mem14#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet15#1;" [2025-03-17 19:55:32,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-17 19:55:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764118513] [2025-03-17 19:55:32,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:32,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:32,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:32,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:32,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:32,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:32,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1240563736, now seen corresponding path program 1 times [2025-03-17 19:55:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:32,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308875251] [2025-03-17 19:55:32,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:32,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:32,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:32,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:32,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:32,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:32,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:32,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:32,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1636020036, now seen corresponding path program 1 times [2025-03-17 19:55:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125141333] [2025-03-17 19:55:32,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:32,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:32,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:32,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:32,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:32,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:32,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:32,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:33,481 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:33,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:33,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:33,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:33,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:33,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:33,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:33,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:33,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i_Iteration1_Lasso [2025-03-17 19:55:33,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:33,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:33,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:33,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:34,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:34,238 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:34,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,242 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-17 19:55:34,244 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-17 19:55:34,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:34,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:34,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:34,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,271 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-17 19:55:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,274 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-17 19:55:34,276 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-17 19:55:34,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:34,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:34,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:34,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,302 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-17 19:55:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,304 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-17 19:55:34,307 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-17 19:55:34,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-17 19:55:34,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:34,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:34,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:34,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,332 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-17 19:55:34,334 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-17 19:55:34,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:34,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:34,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:34,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,354 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-17 19:55:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,356 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-17 19:55:34,357 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-17 19:55:34,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-17 19:55:34,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:34,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:34,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,377 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-17 19:55:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,379 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-17 19:55:34,381 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-17 19:55:34,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:34,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:34,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:34,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,399 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-17 19:55:34,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,400 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-17 19:55:34,401 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-17 19:55:34,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:34,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:34,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,428 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-17 19:55:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,430 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-17 19:55:34,432 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-17 19:55:34,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:34,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:34,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,460 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-17 19:55:34,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,461 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-17 19:55:34,462 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-17 19:55:34,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:34,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:34,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:34,487 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-17 19:55:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,489 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-17 19:55:34,490 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-17 19:55:34,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:34,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:34,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:34,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:34,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:34,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:34,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:34,509 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:34,518 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 19:55:34,521 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:55:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:34,526 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-17 19:55:34,527 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-17 19:55:34,528 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:34,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:34,539 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:34,540 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) 0)_1 Supporting invariants [] [2025-03-17 19:55:34,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:34,598 INFO L156 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2025-03-17 19:55:34,602 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 19:55:34,603 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 19:55:34,603 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-17 19:55:34,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:34,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:34,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:34,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:55:34,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:34,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:34,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:34,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:55:34,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:34,743 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-17 19:55:34,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:55:34,762 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:34,838 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) 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). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 10 states. [2025-03-17 19:55:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2025-03-17 19:55:34,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2025-03-17 19:55:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-17 19:55:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 1 letters. Loop has 12 letters. [2025-03-17 19:55:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:34,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-03-17 19:55:34,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:55:34,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 30 states and 43 transitions. [2025-03-17 19:55:34,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:55:34,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:55:34,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2025-03-17 19:55:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:34,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-03-17 19:55:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2025-03-17 19:55:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-17 19:55:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 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-17 19:55:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-03-17 19:55:34,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-17 19:55:34,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-17 19:55:34,874 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:55:34,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 41 transitions. [2025-03-17 19:55:34,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:55:34,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:34,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:34,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:55:34,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:34,877 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1, main_#t~short12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~mem17#1, main_#t~mem18#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~d~0#1.base, main_~d~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~d~0#1.base, main_~d~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#2(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#0(main_#t~nondet7#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" [2025-03-17 19:55:34,877 INFO L754 eck$LassoCheckResult]: Loop: "assume !main_#t~short10#1;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;call main_#t~mem14#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#2(main_#t~mem14#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet15#1;" "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" [2025-03-17 19:55:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 1 times [2025-03-17 19:55:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360851414] [2025-03-17 19:55:34,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:34,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:34,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:34,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:34,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:55:34,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:55:34,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:34,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:34,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1210950377, now seen corresponding path program 1 times [2025-03-17 19:55:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-17 19:55:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:34,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:34,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:34,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:34,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:34,972 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-17 19:55:34,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:55:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-17 19:55:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350456147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:55:34,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:55:34,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:55:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581018535] [2025-03-17 19:55:34,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:55:34,974 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:55:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:55:34,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:55:34,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:55:34,976 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:55:35,005 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-17 19:55:35,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2025-03-17 19:55:35,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:35,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 19 states and 22 transitions. [2025-03-17 19:55:35,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-17 19:55:35,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 19:55:35,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2025-03-17 19:55:35,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:35,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 19:55:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2025-03-17 19:55:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 19:55:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-17 19:55:35,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 19:55:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:55:35,008 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-17 19:55:35,008 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:55:35,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2025-03-17 19:55:35,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:35,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:35,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:35,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:55:35,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:35,009 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1, main_#t~short12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~mem17#1, main_#t~mem18#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~d~0#1.base, main_~d~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~d~0#1.base, main_~d~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#2(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#0(main_#t~nondet7#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;havoc main_#t~nondet16#1;call write~int#2(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1;call main_#t~mem17#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);call write~int#0(main_#t~mem18#1 - 1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~mem18#1;" [2025-03-17 19:55:35,009 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;call main_#t~mem14#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#2(main_#t~mem14#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet15#1;" [2025-03-17 19:55:35,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1636020037, now seen corresponding path program 1 times [2025-03-17 19:55:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095320022] [2025-03-17 19:55:35,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:35,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:35,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:35,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:35,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:35,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:35,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:35,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1240563736, now seen corresponding path program 2 times [2025-03-17 19:55:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19539580] [2025-03-17 19:55:35,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:35,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:35,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:35,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:35,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:35,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:35,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:35,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1394758564, now seen corresponding path program 1 times [2025-03-17 19:55:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311802368] [2025-03-17 19:55:35,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:35,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:35,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:35,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:35,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:35,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:35,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:35,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:35,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:35,416 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-17 19:55:36,115 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:36,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:36,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:36,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:36,115 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:36,115 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:36,115 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:36,115 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:36,115 INFO L132 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i_Iteration3_Lasso [2025-03-17 19:55:36,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:36,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:36,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:36,642 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:36,642 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:36,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:36,646 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-17 19:55:36,647 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-17 19:55:36,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-17 19:55:36,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:36,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:36,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:36,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:36,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:36,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:36,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:36,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:36,665 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-17 19:55:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:36,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:36,667 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-17 19:55:36,668 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-17 19:55:36,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-17 19:55:36,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:36,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:36,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:36,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:36,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:36,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:36,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:36,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:36,695 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-17 19:55:36,696 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-17 19:55:36,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:36,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:36,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:36,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:36,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:36,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:36,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:36,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:36,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:36,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:55:36,715 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:55:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:36,717 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-17 19:55:36,718 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-17 19:55:36,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:36,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:55:36,719 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:36,719 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 Supporting invariants [] [2025-03-17 19:55:36,725 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-17 19:55:36,763 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2025-03-17 19:55:36,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 19:55:36,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 19:55:36,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-17 19:55:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:36,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:36,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:36,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:36,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:36,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:36,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:55:36,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:36,854 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-17 19:55:36,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:55:36,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-17 19:55:36,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 31 states and 36 transitions. Complement of second has 7 states. [2025-03-17 19:55:36,879 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-17 19:55:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-17 19:55:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-17 19:55:36,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-17 19:55:36,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:36,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:55:36,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:36,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 12 letters. [2025-03-17 19:55:36,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:36,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-17 19:55:36,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:36,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-03-17 19:55:36,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:55:36,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:55:36,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-03-17 19:55:36,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:36,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 19:55:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-03-17 19:55:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 19:55:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-17 19:55:36,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 19:55:36,883 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 19:55:36,883 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:55:36,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2025-03-17 19:55:36,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:55:36,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:36,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:36,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1] [2025-03-17 19:55:36,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:36,883 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1, main_#t~short12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~mem17#1, main_#t~mem18#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~d~0#1.base, main_~d~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~d~0#1.base, main_~d~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#2(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#0(main_#t~nondet7#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;havoc main_#t~nondet16#1;call write~int#2(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1;call main_#t~mem17#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);call write~int#0(main_#t~mem18#1 - 1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~mem18#1;" "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;havoc main_#t~nondet16#1;call write~int#2(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1;call main_#t~mem17#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);call write~int#0(main_#t~mem18#1 - 1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~mem18#1;" [2025-03-17 19:55:36,883 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;call main_#t~mem14#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#2(main_#t~mem14#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~nondet15#1;call write~int#0(main_#t~nondet15#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet15#1;" [2025-03-17 19:55:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1394758563, now seen corresponding path program 2 times [2025-03-17 19:55:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257065628] [2025-03-17 19:55:36,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:36,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:55:36,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:36,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:36,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:36,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1240563736, now seen corresponding path program 3 times [2025-03-17 19:55:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:36,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941564708] [2025-03-17 19:55:36,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:36,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:36,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:36,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:36,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:36,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -811894924, now seen corresponding path program 2 times [2025-03-17 19:55:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-03-17 19:55:36,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:36,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 19:55:36,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:55:36,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:55:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:36,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:36,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 19:55:37,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 19:55:37,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:37,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:37,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:37,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:39,009 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:39,009 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:39,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:39,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:39,010 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:39,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:39,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:39,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i_Iteration4_Lasso [2025-03-17 19:55:39,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:39,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:39,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:39,520 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:39,520 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,522 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-17 19:55:39,523 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-17 19:55:39,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,544 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-17 19:55:39,544 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-17 19:55:39,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-17 19:55:39,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:39,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:39,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:39,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,563 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-17 19:55:39,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,564 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-17 19:55:39,565 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-17 19:55:39,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:39,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:39,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:39,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,585 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-17 19:55:39,586 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-17 19:55:39,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:39,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:39,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:39,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,602 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-17 19:55:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,629 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-17 19:55:39,629 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-17 19:55:39,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,652 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-17 19:55:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,654 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-17 19:55:39,655 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-17 19:55:39,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,676 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-17 19:55:39,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,677 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-17 19:55:39,678 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-17 19:55:39,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,701 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-17 19:55:39,702 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-17 19:55:39,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:39,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:39,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:55:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,729 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-17 19:55:39,730 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-17 19:55:39,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-17 19:55:39,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:39,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:39,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:39,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:39,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:39,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:39,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:39,755 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:55:39,755 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:55:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:39,757 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-17 19:55:39,757 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-17 19:55:39,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:39,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:55:39,769 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:39,769 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x~0#1.base) 0)_2 Supporting invariants [] [2025-03-17 19:55:39,774 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-17 19:55:39,807 INFO L156 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2025-03-17 19:55:39,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 19:55:39,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 19:55:39,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-03-17 19:55:39,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:39,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:39,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:55:39,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:39,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:39,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:55:39,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:55:39,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-17 19:55:39,932 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:39,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 48 transitions. Complement of second has 8 states. [2025-03-17 19:55:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-03-17 19:55:39,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:55:39,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:39,966 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:55:39,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:40,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:55:40,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:40,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:40,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:40,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:55:40,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:40,047 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-17 19:55:40,089 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-17 19:55:40,089 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-17 19:55:40,089 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:40,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 48 transitions. Complement of second has 8 states. [2025-03-17 19:55:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-03-17 19:55:40,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:55:40,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:40,127 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:55:40,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:55:40,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:55:40,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:40,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:55:40,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:40,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:40,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:40,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:55:40,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:40,250 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-17 19:55:40,250 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-17 19:55:40,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:40,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 55 transitions. Complement of second has 7 states. [2025-03-17 19:55:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-17 19:55:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-17 19:55:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:55:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2025-03-17 19:55:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2025-03-17 19:55:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:40,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. [2025-03-17 19:55:40,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:55:40,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 37 states and 43 transitions. [2025-03-17 19:55:40,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 19:55:40,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:55:40,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2025-03-17 19:55:40,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:55:40,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-17 19:55:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2025-03-17 19:55:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 13. [2025-03-17 19:55:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-17 19:55:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-17 19:55:40,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-17 19:55:40,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-17 19:55:40,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:55:40,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-03-17 19:55:40,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:55:40,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:55:40,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:55:40,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:55:40,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:55:40,290 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~short10#1, main_#t~mem11#1, main_#t~short12#1, main_#t~nondet13#1, main_#t~mem14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~mem17#1, main_#t~mem18#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~d~0#1.base, main_~d~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~d~0#1.base, main_~d~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#2(main_#t~nondet5#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#0(main_#t~nondet7#1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-03-17 19:55:40,290 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#2(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem8#1 > 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short10#1 := main_#t~mem9#1 > 0;" "main_#t~short12#1 := main_#t~short10#1;" "assume main_#t~short12#1;call main_#t~mem11#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);main_#t~short12#1 := main_#t~mem11#1 > 0;" "assume main_#t~short12#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;havoc main_#t~mem11#1;havoc main_#t~short12#1;havoc main_#t~nondet13#1;" "assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;havoc main_#t~nondet16#1;call write~int#2(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1;call main_#t~mem17#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem17#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#0(main_~d~0#1.base, main_~d~0#1.offset, 4);call write~int#0(main_#t~mem18#1 - 1, main_~d~0#1.base, main_~d~0#1.offset, 4);havoc main_#t~mem18#1;" [2025-03-17 19:55:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 2 times [2025-03-17 19:55:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405936467] [2025-03-17 19:55:40,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:55:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:40,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:40,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:40,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:55:40,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:40,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:40,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:40,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1240563737, now seen corresponding path program 1 times [2025-03-17 19:55:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-03-17 19:55:40,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:55:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:40,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:40,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:40,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:40,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:40,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:40,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:40,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1636020037, now seen corresponding path program 3 times [2025-03-17 19:55:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:55:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115692932] [2025-03-17 19:55:40,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:55:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:55:40,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:40,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:40,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:55:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:55:40,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:55:40,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:55:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:55:40,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:55:40,783 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:55:40,783 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:55:40,783 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:55:40,783 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:55:40,783 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:55:40,783 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:40,783 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:55:40,783 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:55:40,783 INFO L132 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca-2.i_Iteration5_Lasso [2025-03-17 19:55:40,783 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:55:40,783 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:55:40,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:40,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:55:41,212 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:55:41,213 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:55:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,214 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-17 19:55:41,215 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-17 19:55:41,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:55:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,234 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-17 19:55:41,235 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-17 19:55:41,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,255 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-17 19:55:41,255 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-17 19:55:41,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,275 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-17 19:55:41,275 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-17 19:55:41,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:55:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,295 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-17 19:55:41,296 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-17 19:55:41,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,314 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-17 19:55:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,316 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-17 19:55:41,316 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-17 19:55:41,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-17 19:55:41,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:55:41,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,335 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-17 19:55:41,335 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-17 19:55:41,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-17 19:55:41,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:55:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,358 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:41,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:55:41,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 19:55:41,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,377 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:55:41,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:55:41,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:55:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,396 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-17 19:55:41,397 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-17 19:55:41,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,413 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-17 19:55:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,415 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-17 19:55:41,415 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-17 19:55:41,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:55:41,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:55:41,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:55:41,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,434 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-17 19:55:41,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,435 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-17 19:55:41,436 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-17 19:55:41,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-17 19:55:41,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:55:41,452 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-17 19:55:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,454 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-17 19:55:41,455 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-17 19:55:41,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-17 19:55:41,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:55:41,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:55:41,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:55:41,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:55:41,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:55:41,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:55:41,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:55:41,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:55:41,469 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:55:41,469 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:55:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:55:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:55:41,471 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-17 19:55:41,471 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-17 19:55:41,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:55:41,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:55:41,473 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:55:41,473 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_4) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_4 Supporting invariants [] [2025-03-17 19:55:41,478 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-17 19:55:41,512 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2025-03-17 19:55:41,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 19:55:41,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 19:55:41,513 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-03-17 19:55:41,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:55:41,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:55:41,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:55:41,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:41,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:55:41,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:41,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:55:41,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:55:41,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:55:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:55:41,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:55:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:55:41,567 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-17 19:55:41,611 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-17 19:55:41,612 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-17 19:55:41,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:41,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 44 transitions. Complement of second has 10 states. [2025-03-17 19:55:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:55:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:55:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2025-03-17 19:55:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 1 letters. Loop has 6 letters. [2025-03-17 19:55:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-17 19:55:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 1 letters. Loop has 12 letters. [2025-03-17 19:55:41,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:55:41,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2025-03-17 19:55:41,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:55:41,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2025-03-17 19:55:41,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:55:41,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:55:41,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:55:41,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:55:41,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:41,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:41,641 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:55:41,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:55:41,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:55:41,642 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:55:41,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:55:41,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:55:41 BoogieIcfgContainer [2025-03-17 19:55:41,648 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:55:41,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:55:41,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:55:41,649 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:55:41,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:55:32" (3/4) ... [2025-03-17 19:55:41,650 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:55:41,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:55:41,651 INFO L158 Benchmark]: Toolchain (without parser) took 9659.30ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 147.8MB in the end (delta: 5.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-03-17 19:55:41,651 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:41,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 137.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:55:41,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.27ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 135.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:41,652 INFO L158 Benchmark]: Boogie Preprocessor took 25.01ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:41,653 INFO L158 Benchmark]: IcfgBuilder took 261.04ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 121.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:55:41,653 INFO L158 Benchmark]: BuchiAutomizer took 9078.23ms. Allocated memory is still 201.3MB. Free memory was 121.1MB in the beginning and 147.9MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:41,653 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:55:41,653 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 201.3MB. Free memory was 153.4MB in the beginning and 137.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.27ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 135.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.01ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 261.04ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 121.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 9078.23ms. Allocated memory is still 201.3MB. Free memory was 121.1MB in the beginning and 147.9MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 201.3MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 59 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax107 hnf100 lsp93 ukn68 mio100 lsp21 div100 bol100 ite100 ukn100 eq163 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:55:41,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE