./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:13:55,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:13:55,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:13:55,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:13:55,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:13:55,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:13:55,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:13:55,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:13:55,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:13:55,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:13:55,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:13:55,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:13:55,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:13:55,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:13:55,376 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:13:55,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:13:55,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:13:55,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:13:55,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:13:55,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:13:55,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:13:55,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:13:55,378 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:13:55,378 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2025-03-09 07:13:55,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:13:55,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:13:55,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:13:55,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:13:55,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:13:55,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-09 07:13:56,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71ba696/87175e0f297f4bcaafb6e4e009326eab/FLAG7dd17f3cb [2025-03-09 07:13:56,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:13:56,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-09 07:13:56,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71ba696/87175e0f297f4bcaafb6e4e009326eab/FLAG7dd17f3cb [2025-03-09 07:13:56,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f71ba696/87175e0f297f4bcaafb6e4e009326eab [2025-03-09 07:13:56,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:13:56,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:13:56,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:13:56,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:13:57,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:13:57,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:13:56" (1/1) ... [2025-03-09 07:13:57,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8cba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57, skipping insertion in model container [2025-03-09 07:13:57,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:13:56" (1/1) ... [2025-03-09 07:13:57,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:13:57,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:13:57,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:13:57,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:13:57,148 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:13:57,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57 WrapperNode [2025-03-09 07:13:57,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:13:57,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:13:57,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:13:57,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:13:57,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,179 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 126 [2025-03-09 07:13:57,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:13:57,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:13:57,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:13:57,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:13:57,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,199 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 8 writes are split as follows [0, 3, 5]. [2025-03-09 07:13:57,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:13:57,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:13:57,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:13:57,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:13:57,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (1/1) ... [2025-03-09 07:13:57,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:57,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:57,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:13:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 07:13:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 07:13:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 07:13:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 07:13:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 07:13:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 07:13:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:13:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:13:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 07:13:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 07:13:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 07:13:57,367 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:13:57,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:13:57,568 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc fake_malloc_#t~post10#1; [2025-03-09 07:13:57,568 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: havoc fake_malloc_#t~post10#1; [2025-03-09 07:13:57,582 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-09 07:13:57,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:13:57,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:13:57,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:13:57,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:57 BoogieIcfgContainer [2025-03-09 07:13:57,592 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:13:57,593 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:13:57,593 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:13:57,597 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:13:57,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:57,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:13:56" (1/3) ... [2025-03-09 07:13:57,599 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57427b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:13:57, skipping insertion in model container [2025-03-09 07:13:57,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:57,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:13:57" (2/3) ... [2025-03-09 07:13:57,600 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57427b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:13:57, skipping insertion in model container [2025-03-09 07:13:57,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:13:57,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:57" (3/3) ... [2025-03-09 07:13:57,601 INFO L363 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2025-03-09 07:13:57,632 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:13:57,632 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:13:57,632 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:13:57,632 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:13:57,632 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:13:57,633 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:13:57,633 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:13:57,633 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:13:57,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:57,645 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2025-03-09 07:13:57,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:57,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:57,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:13:57,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:13:57,650 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:13:57,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:57,651 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2025-03-09 07:13:57,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:57,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:57,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:13:57,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:13:57,655 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" [2025-03-09 07:13:57,655 INFO L754 eck$LassoCheckResult]: Loop: "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" [2025-03-09 07:13:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2720, now seen corresponding path program 1 times [2025-03-09 07:13:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133722508] [2025-03-09 07:13:57,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:13:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:13:57,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:57,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:13:57,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:13:57,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:57,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2025-03-09 07:13:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:57,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186307419] [2025-03-09 07:13:57,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:57,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:13:57,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:13:57,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:13:57,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:13:57,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:57,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash 84372, now seen corresponding path program 1 times [2025-03-09 07:13:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:57,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006865329] [2025-03-09 07:13:57,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:13:57,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:13:57,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:57,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:13:57,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:13:57,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:57,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:57,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:58,310 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:13:58,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:13:58,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:13:58,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:13:58,312 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:13:58,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:58,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:13:58,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:13:58,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2025-03-09 07:13:58,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:13:58,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:13:58,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:13:58,949 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:13:58,952 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:13:58,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:58,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:58,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:13:58,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:58,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:58,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:58,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:58,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:58,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:58,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:58,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:58,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:58,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 07:13:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:58,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:58,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:13:58,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:58,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:58,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:58,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:58,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:13:59,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,039 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-09 07:13:59,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:13:59,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:13:59,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:13:59,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 07:13:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:13:59,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:13:59,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:13:59,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:13:59,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,216 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-09 07:13:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,218 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:13:59,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:13:59,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:13:59,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-09 07:13:59,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,302 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-09 07:13:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,305 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:13:59,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:13:59,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:13:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,363 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:13:59,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,389 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-09 07:13:59,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,391 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:13:59,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,418 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:13:59,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:13:59,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:13:59,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:13:59,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:13:59,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:13:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,442 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:13:59,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:13:59,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:13:59,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:13:59,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:13:59,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:13:59,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:13:59,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:13:59,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:13:59,518 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-03-09 07:13:59,520 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-03-09 07:13:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:13:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,524 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:13:59,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:13:59,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:13:59,539 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:13:59,540 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2025-03-09 07:13:59,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,577 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2025-03-09 07:13:59,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:59,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:13:59,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:13:59,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:59,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:13:59,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:13:59,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:13:59,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:13:59,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:59,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:13:59,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:13:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:13:59,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 07:13:59,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:59,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 07:13:59,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 47 transitions. Complement of second has 3 states. [2025-03-09 07:13:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 07:13:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 07:13:59,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-09 07:13:59,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:59,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 07:13:59,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:59,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 07:13:59,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:13:59,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2025-03-09 07:13:59,722 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-09 07:13:59,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 42 transitions. [2025-03-09 07:13:59,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 07:13:59,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-09 07:13:59,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-03-09 07:13:59,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:13:59,727 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-09 07:13:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-03-09 07:13:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 07:13:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-09 07:13:59,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-09 07:13:59,744 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-09 07:13:59,744 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:13:59,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-09 07:13:59,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-09 07:13:59,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:59,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:59,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:13:59,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:13:59,745 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-09 07:13:59,745 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-09 07:13:59,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 612392913, now seen corresponding path program 1 times [2025-03-09 07:13:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017735716] [2025-03-09 07:13:59,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:59,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:13:59,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:13:59,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:13:59,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:13:59,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017735716] [2025-03-09 07:13:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017735716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:13:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:13:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:13:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411878080] [2025-03-09 07:13:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:13:59,807 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:13:59,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 1 times [2025-03-09 07:13:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298819135] [2025-03-09 07:13:59,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:59,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:13:59,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:13:59,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:59,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:13:59,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:13:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:13:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:13:59,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:13:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:13:59,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:13:59,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:13:59,874 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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-09 07:13:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:13:59,884 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-09 07:13:59,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2025-03-09 07:13:59,885 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-09 07:13:59,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 33 transitions. [2025-03-09 07:13:59,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:13:59,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:13:59,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2025-03-09 07:13:59,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:13:59,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-09 07:13:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2025-03-09 07:13:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-09 07:13:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:13:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-09 07:13:59,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-09 07:13:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:13:59,892 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-09 07:13:59,892 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:13:59,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2025-03-09 07:13:59,893 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-09 07:13:59,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:13:59,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:13:59,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:13:59,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:13:59,895 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-09 07:13:59,895 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-09 07:13:59,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:13:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1777621341, now seen corresponding path program 1 times [2025-03-09 07:13:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:13:59,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235559761] [2025-03-09 07:13:59,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:59,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:13:59,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:13:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:13:59,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:13:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:13:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:13:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:13:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235559761] [2025-03-09 07:13:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235559761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:13:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273626225] [2025-03-09 07:13:59,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:13:59,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:13:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:13:59,977 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:13:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 07:14:00,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:14:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:14:00,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:00,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:14:00,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:00,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273626225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:00,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-09 07:14:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162057249] [2025-03-09 07:14:00,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:00,066 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:00,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 2 times [2025-03-09 07:14:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019182078] [2025-03-09 07:14:00,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:00,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:00,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:00,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:00,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:00,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:14:00,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:14:00,119 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:00,131 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2025-03-09 07:14:00,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2025-03-09 07:14:00,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-09 07:14:00,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2025-03-09 07:14:00,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:14:00,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:14:00,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2025-03-09 07:14:00,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:00,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-09 07:14:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2025-03-09 07:14:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-09 07:14:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-09 07:14:00,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-09 07:14:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:14:00,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-09 07:14:00,134 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:14:00,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2025-03-09 07:14:00,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-09 07:14:00,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:00,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:00,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:00,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:00,135 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-09 07:14:00,135 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-09 07:14:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -755003055, now seen corresponding path program 2 times [2025-03-09 07:14:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077946181] [2025-03-09 07:14:00,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:00,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 07:14:00,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:00,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:14:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:14:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:00,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:00,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 3 times [2025-03-09 07:14:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123272574] [2025-03-09 07:14:00,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:14:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:00,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:00,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:00,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:14:00,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:00,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:00,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:00,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:00,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:00,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 291538384, now seen corresponding path program 1 times [2025-03-09 07:14:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:00,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429336201] [2025-03-09 07:14:00,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:00,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:14:00,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:14:00,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429336201] [2025-03-09 07:14:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429336201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397331773] [2025-03-09 07:14:00,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:00,580 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:00,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 07:14:00,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 07:14:00,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 07:14:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 07:14:00,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:00,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:00,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:00,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:00,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:00,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:00,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:00,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:00,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2025-03-09 07:14:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-03-09 07:14:00,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2025-03-09 07:14:00,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2025-03-09 07:14:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397331773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:00,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 07:14:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198709827] [2025-03-09 07:14:00,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:00,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 07:14:00,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-09 07:14:00,948 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 13 Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:01,061 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-09 07:14:01,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2025-03-09 07:14:01,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-09 07:14:01,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 32 transitions. [2025-03-09 07:14:01,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:14:01,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:14:01,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2025-03-09 07:14:01,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:01,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-09 07:14:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2025-03-09 07:14:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-09 07:14:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-09 07:14:01,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-09 07:14:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 07:14:01,065 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-09 07:14:01,065 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:14:01,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2025-03-09 07:14:01,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-09 07:14:01,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:01,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:01,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:01,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:01,065 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-09 07:14:01,066 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-09 07:14:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 447755283, now seen corresponding path program 1 times [2025-03-09 07:14:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-09 07:14:01,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:01,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:14:01,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:14:01,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:01,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:14:01,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:14:01,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:01,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2025-03-09 07:14:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391980521] [2025-03-09 07:14:01,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:01,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:01,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:01,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:01,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 796098354, now seen corresponding path program 1 times [2025-03-09 07:14:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706876787] [2025-03-09 07:14:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:14:01,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:14:01,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:01,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:14:01,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:14:01,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:01,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:01,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:15,415 WARN L286 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 288 DAG size of output: 249 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 07:14:15,907 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:14:15,908 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:14:15,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:14:15,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:14:15,908 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:14:15,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:15,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:14:15,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:14:15,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2025-03-09 07:14:15,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:14:15,908 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:14:15,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:15,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:16,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:16,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:16,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:16,527 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:14:16,527 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:14:16,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,530 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:14:16,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,554 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-09 07:14:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,556 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:14:16,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 07:14:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,579 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:14:16,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:14:16,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,602 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:14:16,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,623 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-09 07:14:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,625 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:14:16,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:14:16,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,645 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:14:16,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 07:14:16,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,668 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:14:16,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:14:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,690 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:14:16,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:14:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,715 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:14:16,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,734 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-09 07:14:16,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,736 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:14:16,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,754 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-09 07:14:16,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,757 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-09 07:14:16,757 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-09 07:14:16,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,779 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-09 07:14:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,781 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-09 07:14:16,782 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-09 07:14:16,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:16,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,802 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:14:16,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 07:14:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,823 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:14:16,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 07:14:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,846 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 07:14:16,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 07:14:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,877 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 07:14:16,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:16,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,897 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 07:14:16,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,918 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 07:14:16,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 07:14:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,940 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 07:14:16,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:16,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:16,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 07:14:16,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,963 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 07:14:16,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:16,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 07:14:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:16,983 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 07:14:16,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:16,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:16,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:16,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:16,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:16,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:16,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:16,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:16,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,003 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 07:14:17,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:17,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:17,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:17,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 07:14:17,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,023 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 07:14:17,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 07:14:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,049 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 07:14:17,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 07:14:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,071 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 07:14:17,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 07:14:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,092 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 07:14:17,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:17,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:17,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:17,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 07:14:17,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,112 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 07:14:17,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:17,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:17,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:17,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,143 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 07:14:17,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,166 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 07:14:17,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,192 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 07:14:17,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:17,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:17,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:17,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,213 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 07:14:17,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:17,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:17,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:17,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,233 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 07:14:17,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 07:14:17,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,260 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 07:14:17,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,285 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 07:14:17,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:17,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:17,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:17,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:17,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:17,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:17,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:17,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:14:17,330 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-09 07:14:17,330 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-09 07:14:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:17,332 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:14:17,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 07:14:17,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:14:17,346 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:14:17,348 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:14:17,348 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_2, ULTIMATE.start_f_~i~1#1) = 1*v_rep(select #length ~#pp~0.base)_2 - 2*ULTIMATE.start_f_~i~1#1 Supporting invariants [] [2025-03-09 07:14:17,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:17,369 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-03-09 07:14:17,371 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:14:17,372 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:14:17,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:14:17,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:14:17,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:17,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:14:17,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:17,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:17,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:14:17,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:17,445 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:14:17,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 29 states and 37 transitions. Complement of second has 5 states. [2025-03-09 07:14:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:14:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-09 07:14:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 07:14:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-09 07:14:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:17,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-09 07:14:17,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:17,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-03-09 07:14:17,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2025-03-09 07:14:17,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 07:14:17,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-09 07:14:17,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2025-03-09 07:14:17,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:17,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-09 07:14:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2025-03-09 07:14:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-09 07:14:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-09 07:14:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-09 07:14:17,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-09 07:14:17,469 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-09 07:14:17,469 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:14:17,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2025-03-09 07:14:17,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:17,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:17,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:17,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:14:17,470 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-09 07:14:17,470 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-09 07:14:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,471 INFO L85 PathProgramCache]: Analyzing trace with hash 796098381, now seen corresponding path program 1 times [2025-03-09 07:14:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:17,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234303005] [2025-03-09 07:14:17,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:14:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:14:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:17,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:17,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234303005] [2025-03-09 07:14:17,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234303005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:14:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:14:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71411462] [2025-03-09 07:14:17,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:17,507 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 1 times [2025-03-09 07:14:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908463621] [2025-03-09 07:14:17,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:17,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:17,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:17,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:17,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:17,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:14:17,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:14:17,550 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:17,565 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-09 07:14:17,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-09 07:14:17,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2025-03-09 07:14:17,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-09 07:14:17,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-09 07:14:17,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2025-03-09 07:14:17,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:17,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-09 07:14:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2025-03-09 07:14:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-09 07:14:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-09 07:14:17,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-09 07:14:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:14:17,568 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-09 07:14:17,568 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:14:17,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2025-03-09 07:14:17,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:17,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:17,569 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:17,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:14:17,569 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-09 07:14:17,569 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-09 07:14:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1090754838, now seen corresponding path program 1 times [2025-03-09 07:14:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829545120] [2025-03-09 07:14:17,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:17,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 07:14:17,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 07:14:17,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:17,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 07:14:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:17,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:17,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829545120] [2025-03-09 07:14:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829545120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:14:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 07:14:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604009848] [2025-03-09 07:14:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:17,860 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 2 times [2025-03-09 07:14:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471904600] [2025-03-09 07:14:17,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:17,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:17,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:17,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:17,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:17,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:17,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:17,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:17,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:17,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 07:14:17,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 07:14:17,906 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:17,968 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-09 07:14:17,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2025-03-09 07:14:17,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions. [2025-03-09 07:14:17,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-09 07:14:17,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-09 07:14:17,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2025-03-09 07:14:17,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:17,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-09 07:14:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2025-03-09 07:14:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-09 07:14:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-09 07:14:17,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-09 07:14:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:14:17,971 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-09 07:14:17,971 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:14:17,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-03-09 07:14:17,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:17,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:17,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:17,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:17,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:14:17,972 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-09 07:14:17,973 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-09 07:14:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 546340524, now seen corresponding path program 1 times [2025-03-09 07:14:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:17,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919310129] [2025-03-09 07:14:17,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:17,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:14:17,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:14:17,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:17,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919310129] [2025-03-09 07:14:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919310129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006242003] [2025-03-09 07:14:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:18,013 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-09 07:14:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:14:18,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:14:18,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:18,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:14:18,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:18,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:18,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006242003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:18,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-09 07:14:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213825320] [2025-03-09 07:14:18,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:18,105 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:18,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 3 times [2025-03-09 07:14:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212802388] [2025-03-09 07:14:18,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:14:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:18,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:18,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:18,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:14:18,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:18,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:18,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:18,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:14:18,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:14:18,168 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:18,191 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-09 07:14:18,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-09 07:14:18,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:18,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2025-03-09 07:14:18,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:14:18,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:14:18,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2025-03-09 07:14:18,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:18,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-09 07:14:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2025-03-09 07:14:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-09 07:14:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-09 07:14:18,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-09 07:14:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:14:18,193 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-09 07:14:18,193 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:14:18,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2025-03-09 07:14:18,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:18,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:18,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:18,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:18,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:14:18,194 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-09 07:14:18,194 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-09 07:14:18,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash -243313813, now seen corresponding path program 1 times [2025-03-09 07:14:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:18,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466348435] [2025-03-09 07:14:18,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:18,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:14:18,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:14:18,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:18,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:14:18,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:14:18,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:18,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 4 times [2025-03-09 07:14:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:18,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805559311] [2025-03-09 07:14:18,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:14:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:18,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-09 07:14:18,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:18,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:14:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:18,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:18,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:18,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:18,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:18,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1343016357, now seen corresponding path program 1 times [2025-03-09 07:14:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:18,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406131612] [2025-03-09 07:14:18,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:18,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 07:14:18,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 07:14:18,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:18,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406131612] [2025-03-09 07:14:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406131612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607280965] [2025-03-09 07:14:18,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:18,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:18,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:18,980 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:18,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-09 07:14:19,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 07:14:19,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 07:14:19,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:19,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 07:14:19,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:19,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:19,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:19,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:19,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:19,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 07:14:19,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 07:14:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:19,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:14:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607280965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:14:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2025-03-09 07:14:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177553452] [2025-03-09 07:14:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:19,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 07:14:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-09 07:14:19,304 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:19,423 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-09 07:14:19,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-03-09 07:14:19,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:19,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2025-03-09 07:14:19,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 07:14:19,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-09 07:14:19,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-03-09 07:14:19,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:19,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-09 07:14:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-03-09 07:14:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-09 07:14:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-09 07:14:19,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-09 07:14:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:14:19,427 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-09 07:14:19,427 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:14:19,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2025-03-09 07:14:19,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:19,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:19,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:19,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:19,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:14:19,428 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-09 07:14:19,428 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-09 07:14:19,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1896339543, now seen corresponding path program 1 times [2025-03-09 07:14:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020297584] [2025-03-09 07:14:19,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:14:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:14:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:19,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:19,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:14:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:14:19,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:19,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 48514929, now seen corresponding path program 1 times [2025-03-09 07:14:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300380402] [2025-03-09 07:14:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:19,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:19,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:19,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:19,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:19,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:19,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:19,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:19,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1164269367, now seen corresponding path program 1 times [2025-03-09 07:14:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968347355] [2025-03-09 07:14:19,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:19,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:14:19,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:14:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968347355] [2025-03-09 07:14:19,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968347355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939753583] [2025-03-09 07:14:19,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:19,963 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-03-09 07:14:20,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:14:20,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:14:20,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:20,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:20,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 07:14:20,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:20,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:20,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:20,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-09 07:14:20,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 07:14:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 07:14:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939753583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:20,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-03-09 07:14:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890710955] [2025-03-09 07:14:20,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 07:14:20,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-09 07:14:20,501 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 11 Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:20,865 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-09 07:14:20,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2025-03-09 07:14:20,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:20,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 52 transitions. [2025-03-09 07:14:20,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-09 07:14:20,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-09 07:14:20,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2025-03-09 07:14:20,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:14:20,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-09 07:14:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2025-03-09 07:14:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-03-09 07:14:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-09 07:14:20,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-09 07:14:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 07:14:20,871 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-09 07:14:20,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:14:20,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2025-03-09 07:14:20,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:20,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:20,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:20,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:20,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:14:20,872 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-09 07:14:20,872 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-09 07:14:20,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1345044105, now seen corresponding path program 1 times [2025-03-09 07:14:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:20,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288609694] [2025-03-09 07:14:20,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:20,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 07:14:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 07:14:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288609694] [2025-03-09 07:14:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288609694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894943284] [2025-03-09 07:14:21,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:21,282 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:21,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-09 07:14:21,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 07:14:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 07:14:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:21,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 07:14:21,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:21,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:21,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 07:14:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:21,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 07:14:21,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-09 07:14:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:21,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-09 07:14:21,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-09 07:14:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894943284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:21,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2025-03-09 07:14:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978546961] [2025-03-09 07:14:21,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:21,677 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 48514929, now seen corresponding path program 2 times [2025-03-09 07:14:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53865731] [2025-03-09 07:14:21,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:21,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:21,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:21,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:21,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:21,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:21,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:21,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:21,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:21,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:21,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 07:14:21,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-09 07:14:21,839 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 12 Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:22,081 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-09 07:14:22,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2025-03-09 07:14:22,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:22,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. [2025-03-09 07:14:22,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-09 07:14:22,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-09 07:14:22,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2025-03-09 07:14:22,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:22,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-09 07:14:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2025-03-09 07:14:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 07:14:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-09 07:14:22,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-09 07:14:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 07:14:22,084 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-09 07:14:22,084 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:14:22,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2025-03-09 07:14:22,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 07:14:22,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:22,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:22,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:14:22,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:14:22,085 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" [2025-03-09 07:14:22,085 INFO L754 eck$LassoCheckResult]: Loop: "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" [2025-03-09 07:14:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1407215172, now seen corresponding path program 1 times [2025-03-09 07:14:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-03-09 07:14:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:22,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:14:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:14:22,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 07:14:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-03-09 07:14:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998521472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367454819] [2025-03-09 07:14:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:22,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:22,140 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:22,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-09 07:14:22,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 07:14:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 07:14:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:22,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:14:22,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 07:14:22,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:14:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367454819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:14:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-09 07:14:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150149786] [2025-03-09 07:14:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:22,283 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 44973, now seen corresponding path program 5 times [2025-03-09 07:14:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410172235] [2025-03-09 07:14:22,283 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:14:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:22,286 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:22,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:22,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:22,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:22,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:22,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:14:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 07:14:22,335 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:22,368 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-03-09 07:14:22,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2025-03-09 07:14:22,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:14:22,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2025-03-09 07:14:22,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:14:22,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:14:22,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:14:22,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:22,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:14:22,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:14:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:14:22,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:14:22,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:14:22,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:14:22,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:14:22,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:14:22,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:14:22 BoogieIcfgContainer [2025-03-09 07:14:22,375 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:14:22,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:14:22,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:14:22,376 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:14:22,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:13:57" (3/4) ... [2025-03-09 07:14:22,378 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:14:22,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:14:22,380 INFO L158 Benchmark]: Toolchain (without parser) took 25382.48ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 155.6MB in the beginning and 261.6MB in the end (delta: -106.0MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2025-03-09 07:14:22,380 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:22,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.76ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 144.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:14:22,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.79ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:22,380 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 140.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:14:22,381 INFO L158 Benchmark]: IcfgBuilder took 376.69ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 122.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:14:22,381 INFO L158 Benchmark]: BuchiAutomizer took 24782.10ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 122.1MB in the beginning and 261.6MB in the end (delta: -139.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:22,381 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 318.8MB. Free memory was 261.6MB in the beginning and 261.6MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:14:22,382 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.17ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.76ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 144.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.79ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 142.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 140.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 376.69ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 122.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 24782.10ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 122.1MB in the beginning and 261.6MB in the end (delta: -139.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 318.8MB. Free memory was 261.6MB in the beginning and 261.6MB in the end (delta: 60.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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (3 + ((long long) -2 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.7s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 23.3s. Construction of modules took 0.5s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 705 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 237 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU7 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital307 mio100 ax100 hnf100 lsp74 ukn63 mio100 lsp39 div100 bol100 ite100 ukn100 eq165 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms 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-09 07:14:22,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:22,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-03-09 07:14:22,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:23,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-03-09 07:14:23,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-03-09 07:14:23,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 07:14:23,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 07:14:23,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE