./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:58:35,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:58:35,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:58:35,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:58:35,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:58:35,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:58:35,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:58:35,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:58:35,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:58:35,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:58:35,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:58:35,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:58:35,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:58:35,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:58:35,371 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:58:35,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:58:35,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:58:35,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:58:35,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:58:35,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:58:35,372 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:58:35,372 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2025-03-17 19:58:35,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:58:35,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:58:35,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:58:35,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:58:35,624 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:58:35,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-03-17 19:58:36,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997ad80ae/a693bb123c444862aa29e8e8b64b1fdc/FLAG15b2b4f74 [2025-03-17 19:58:37,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:58:37,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-03-17 19:58:37,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997ad80ae/a693bb123c444862aa29e8e8b64b1fdc/FLAG15b2b4f74 [2025-03-17 19:58:37,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997ad80ae/a693bb123c444862aa29e8e8b64b1fdc [2025-03-17 19:58:37,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:58:37,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:58:37,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:58:37,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:58:37,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:58:37,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ce3282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37, skipping insertion in model container [2025-03-17 19:58:37,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:58:37,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:58:37,669 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:58:37,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:58:37,743 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:58:37,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37 WrapperNode [2025-03-17 19:58:37,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:58:37,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:58:37,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:58:37,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:58:37,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,772 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-03-17 19:58:37,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:58:37,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:58:37,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:58:37,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:58:37,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,794 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-17 19:58:37,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:58:37,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:58:37,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:58:37,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:58:37,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (1/1) ... [2025-03-17 19:58:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:37,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:37,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:58:37,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:58:37,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:58:37,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:58:37,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:58:37,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:58:37,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:58:37,914 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:58:37,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:58:38,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: call ULTIMATE.dealloc(main_#t~malloc206#1.base, main_#t~malloc206#1.offset);havoc main_#t~malloc206#1.base, main_#t~malloc206#1.offset; [2025-03-17 19:58:38,038 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 19:58:38,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:58:38,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:58:38,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:58:38,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:58:38 BoogieIcfgContainer [2025-03-17 19:58:38,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:58:38,046 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:58:38,046 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:58:38,050 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:58:38,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:38,051 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:58:37" (1/3) ... [2025-03-17 19:58:38,051 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78319a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:58:38, skipping insertion in model container [2025-03-17 19:58:38,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:38,052 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:58:37" (2/3) ... [2025-03-17 19:58:38,052 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78319a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:58:38, skipping insertion in model container [2025-03-17 19:58:38,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:58:38,052 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:58:38" (3/3) ... [2025-03-17 19:58:38,053 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2025-03-17 19:58:38,089 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:58:38,089 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:58:38,089 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:58:38,089 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:58:38,089 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:58:38,090 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:58:38,090 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:58:38,090 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:58:38,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:38,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 19:58:38,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:38,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:38,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:58:38,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:58:38,112 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:58:38,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:38,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 19:58:38,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:38,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:38,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:58:38,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:58:38,119 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" [2025-03-17 19:58:38,119 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" [2025-03-17 19:58:38,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1599711, now seen corresponding path program 1 times [2025-03-17 19:58:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60432252] [2025-03-17 19:58:38,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:38,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:38,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-17 19:58:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092346687] [2025-03-17 19:58:38,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:38,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:58:38,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:58:38,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:38,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:58:38,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:58:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:38,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 49591054, now seen corresponding path program 1 times [2025-03-17 19:58:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619132343] [2025-03-17 19:58:38,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:38,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:38,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:38,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:38,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:38,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:38,614 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:38,615 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:38,615 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:38,615 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:38,615 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:38,615 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:38,616 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:38,616 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:38,616 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2025-03-17 19:58:38,616 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:38,616 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:38,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:38,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,109 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:39,111 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:58:39,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:39,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:58:39,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:39,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:58:39,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 19:58:39,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:58:39,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:58:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:58:39,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:39,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:39,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:39,278 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 19:58:39,280 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:58:39,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:58:39,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:39,299 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:58:39,299 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:39,300 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:58:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:39,319 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-17 19:58:39,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:39,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:39,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:39,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:58:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:39,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:58:39,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:58:39,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:39,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:58:39,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:39,386 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-17 19:58:39,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:39,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 23 transitions. Complement of second has 3 states. [2025-03-17 19:58:39,412 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-17 19:58:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2025-03-17 19:58:39,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 19:58:39,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:39,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-17 19:58:39,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:39,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:58:39,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:39,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-03-17 19:58:39,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:58:39,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 16 transitions. [2025-03-17 19:58:39,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:58:39,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:58:39,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-03-17 19:58:39,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:58:39,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-17 19:58:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-03-17 19:58:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-17 19:58:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-17 19:58:39,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 19:58:39,443 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-17 19:58:39,443 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:58:39,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-17 19:58:39,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:58:39,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:39,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:39,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:58:39,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:58:39,444 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-03-17 19:58:39,444 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume !true;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-17 19:58:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 49591053, now seen corresponding path program 1 times [2025-03-17 19:58:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123382108] [2025-03-17 19:58:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:39,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:39,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:39,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:39,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-03-17 19:58:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-03-17 19:58:39,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:39,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:58:39,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:58:39,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867265721] [2025-03-17 19:58:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867265721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:58:39,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:58:39,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:58:39,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659112014] [2025-03-17 19:58:39,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:58:39,492 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:58:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:39,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:58:39,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:58:39,494 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:39,496 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-17 19:58:39,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-17 19:58:39,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:58:39,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 19:58:39,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:58:39,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:58:39,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-17 19:58:39,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:58:39,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 19:58:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-17 19:58:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 19:58:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 19:58:39,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 19:58:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:58:39,500 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 19:58:39,500 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:58:39,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-17 19:58:39,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:58:39,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:39,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:39,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:58:39,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:58:39,501 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-03-17 19:58:39,501 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-03-17 19:58:39,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 49591053, now seen corresponding path program 2 times [2025-03-17 19:58:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109740656] [2025-03-17 19:58:39,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:39,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:39,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:39,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:39,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:39,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:39,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-03-17 19:58:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742471403] [2025-03-17 19:58:39,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:39,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:39,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:39,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:39,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1142916936, now seen corresponding path program 1 times [2025-03-17 19:58:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728968566] [2025-03-17 19:58:39,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:58:39,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:58:39,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:39,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:58:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:58:39,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:39,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:39,704 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:39,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:39,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:39,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:39,704 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:39,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:39,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:39,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2025-03-17 19:58:39,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:39,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:39,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:39,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:39,957 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:39,957 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:39,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:58:39,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:58:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:39,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:39,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:58:39,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:39,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:39,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:39,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:39,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:39,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:39,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:39,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:39,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:39,998 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-17 19:58:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,000 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:58:40,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:58:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,020 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:58:40,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:58:40,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:58:40,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:58:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:58:40,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:58:40,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,081 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:58:40,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:58:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:58:40,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:58:40,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,125 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:58:40,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,143 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-17 19:58:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,145 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:58:40,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:40,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:40,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:40,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:58:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:58:40,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:40,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:40,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:58:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,214 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:58:40,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:40,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:40,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,238 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-17 19:58:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:58:40,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:40,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:40,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:58:40,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,266 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:58:40,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:40,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:40,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:40,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,292 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:58:40,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:40,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:40,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:40,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:40,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:40,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:40,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:40,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:40,338 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 19:58:40,338 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 19:58:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,342 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:58:40,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:40,354 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:58:40,354 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:40,354 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2025-03-17 19:58:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:40,367 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 19:58:40,369 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:58:40,370 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:58:40,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:58:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:58:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:40,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:58:40,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:40,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:40,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:40,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:40,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:58:40,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:40,439 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:58:40,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:40,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 7 states. [2025-03-17 19:58:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-17 19:58:40,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:58:40,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:40,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 19:58:40,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:40,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-17 19:58:40,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:40,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-17 19:58:40,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2025-03-17 19:58:40,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:40,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:58:40,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-03-17 19:58:40,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:40,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-17 19:58:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-03-17 19:58:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-17 19:58:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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-17 19:58:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-17 19:58:40,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 19:58:40,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 19:58:40,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:58:40,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-17 19:58:40,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:40,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:40,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:58:40,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:40,485 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:40,485 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:40,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1537322654, now seen corresponding path program 1 times [2025-03-17 19:58:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561310193] [2025-03-17 19:58:40,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:58:40,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:58:40,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:40,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:58:40,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:58:40,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:40,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-17 19:58:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877513666] [2025-03-17 19:58:40,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash -101679043, now seen corresponding path program 1 times [2025-03-17 19:58:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873172851] [2025-03-17 19:58:40,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:58:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:58:40,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873172851] [2025-03-17 19:58:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873172851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:58:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:58:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:58:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150726566] [2025-03-17 19:58:40,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:58:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:40,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:58:40,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:58:40,714 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:40,743 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2025-03-17 19:58:40,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2025-03-17 19:58:40,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 29 transitions. [2025-03-17 19:58:40,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 19:58:40,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:58:40,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-03-17 19:58:40,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:40,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-17 19:58:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-03-17 19:58:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2025-03-17 19:58:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-17 19:58:40,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 19:58:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:58:40,750 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-17 19:58:40,750 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:58:40,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-03-17 19:58:40,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:40,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:40,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:40,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:40,751 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:40,752 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:40,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1070686659, now seen corresponding path program 2 times [2025-03-17 19:58:40,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824605538] [2025-03-17 19:58:40,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:58:40,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:58:40,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:40,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:40,813 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-17 19:58:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824605538] [2025-03-17 19:58:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824605538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830610197] [2025-03-17 19:58:40,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:40,816 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:40,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 19:58:40,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:58:40,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:58:40,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:40,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:40,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:58:40,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:40,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:58:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830610197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:58:40,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:58:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:58:40,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976723062] [2025-03-17 19:58:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:58:40,887 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-17 19:58:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739230214] [2025-03-17 19:58:40,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:40,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:40,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:40,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:58:40,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:40,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:58:40,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:58:40,938 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.5) 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-17 19:58:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:40,956 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-17 19:58:40,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-03-17 19:58:40,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2025-03-17 19:58:40,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:40,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:58:40,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2025-03-17 19:58:40,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:40,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-17 19:58:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2025-03-17 19:58:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 19:58:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-17 19:58:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-17 19:58:40,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-17 19:58:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:58:40,959 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-17 19:58:40,959 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:58:40,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-17 19:58:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:40,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:40,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:40,960 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:40,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:40,960 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:40,960 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash -250409806, now seen corresponding path program 1 times [2025-03-17 19:58:40,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998023519] [2025-03-17 19:58:40,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:40,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:40,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:40,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:40,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:40,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:40,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-17 19:58:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140924477] [2025-03-17 19:58:40,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:40,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:58:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:40,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:40,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:40,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:40,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:40,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:40,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -125654703, now seen corresponding path program 1 times [2025-03-17 19:58:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632031905] [2025-03-17 19:58:40,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:58:41,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:58:41,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:41,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:41,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:58:41,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:58:41,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:41,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:41,240 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:41,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:41,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:41,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:41,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:41,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:41,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:41,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2025-03-17 19:58:41,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:41,241 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:41,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:41,520 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:41,521 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,523 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:58:41,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:41,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:41,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:41,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,544 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:58:41,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:41,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:41,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:41,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:58:41,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,567 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:58:41,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:41,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:41,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:41,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:58:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,587 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:58:41,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:41,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:41,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,609 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-17 19:58:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,611 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:58:41,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:41,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:41,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:41,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,631 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-17 19:58:41,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,633 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:58:41,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:41,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:41,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:41,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,651 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-17 19:58:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,653 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:58:41,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:41,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:41,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:58:41,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,683 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:58:41,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:41,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:41,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:41,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:58:41,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,709 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:58:41,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:41,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:41,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:41,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:41,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:41,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:41,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:41,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:41,741 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:58:41,741 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 19:58:41,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:41,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:41,744 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:41,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:58:41,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:41,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:58:41,756 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:41,756 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2025-03-17 19:58:41,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:41,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:41,793 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:58:41,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:58:41,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:58:41,795 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-17 19:58:41,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:41,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:41,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:41,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:41,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:41,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:41,920 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:41,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:41,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 15 states and 19 transitions. Complement of second has 5 states. [2025-03-17 19:58:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:58:41,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:58:41,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:41,951 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:41,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:41,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:41,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:41,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:41,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:41,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:41,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:42,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:42,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,072 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:42,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,110 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 15 states and 19 transitions. Complement of second has 5 states. [2025-03-17 19:58:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:58:42,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:58:42,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:42,112 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:42,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:42,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:42,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:42,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:42,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:42,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:42,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:42,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:42,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,230 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:42,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 36 transitions. Complement of second has 11 states. [2025-03-17 19:58:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:58:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-03-17 19:58:42,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 19:58:42,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:42,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 19:58:42,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:42,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 19:58:42,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:42,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2025-03-17 19:58:42,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:42,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 29 transitions. [2025-03-17 19:58:42,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:58:42,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:58:42,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2025-03-17 19:58:42,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:42,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 19:58:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2025-03-17 19:58:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-03-17 19:58:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-17 19:58:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-17 19:58:42,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-17 19:58:42,316 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-17 19:58:42,316 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:58:42,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-03-17 19:58:42,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:42,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:42,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:42,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:42,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:42,316 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:42,319 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:42,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash -495086121, now seen corresponding path program 2 times [2025-03-17 19:58:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:42,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915899408] [2025-03-17 19:58:42,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:42,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:58:42,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:58:42,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915899408] [2025-03-17 19:58:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915899408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130716340] [2025-03-17 19:58:42,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:42,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:42,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:42,376 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:42,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-17 19:58:42,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:58:42,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:58:42,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:42,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:58:42,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130716340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:42,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 19:58:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187676759] [2025-03-17 19:58:42,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:42,501 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-17 19:58:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:42,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950267651] [2025-03-17 19:58:42,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:42,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:58:42,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:42,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:42,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:42,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:42,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:42,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:42,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:42,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:42,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:42,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:58:42,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:58:42,536 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:42,577 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-17 19:58:42,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2025-03-17 19:58:42,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:42,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 26 transitions. [2025-03-17 19:58:42,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:42,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:58:42,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2025-03-17 19:58:42,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:42,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 19:58:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2025-03-17 19:58:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 19:58:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-17 19:58:42,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 19:58:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:58:42,583 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 19:58:42,583 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:58:42,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-03-17 19:58:42,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:42,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:42,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:42,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:58:42,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:42,584 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:42,584 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2121504696, now seen corresponding path program 3 times [2025-03-17 19:58:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658236394] [2025-03-17 19:58:42,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:42,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-17 19:58:42,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:58:42,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:58:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:42,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658236394] [2025-03-17 19:58:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658236394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139431512] [2025-03-17 19:58:42,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:42,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:42,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:42,929 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:42,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-17 19:58:42,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-17 19:58:42,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:58:42,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:58:42,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:42,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:58:42,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:42,999 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-17 19:58:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-03-17 19:58:43,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:43,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 19:58:43,181 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-17 19:58:43,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 29 [2025-03-17 19:58:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:43,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139431512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:43,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-17 19:58:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765328727] [2025-03-17 19:58:43,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:43,549 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-03-17 19:58:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864929759] [2025-03-17 19:58:43,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:43,554 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:43,555 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:43,555 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:43,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:43,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:43,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:43,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:43,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:43,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:43,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:58:43,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:58:43,595 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 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-17 19:58:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:44,476 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-03-17 19:58:44,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2025-03-17 19:58:44,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:44,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 41 transitions. [2025-03-17 19:58:44,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:58:44,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:58:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2025-03-17 19:58:44,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:44,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-17 19:58:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2025-03-17 19:58:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2025-03-17 19:58:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-17 19:58:44,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 19:58:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:58:44,479 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 19:58:44,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:58:44,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-03-17 19:58:44,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:44,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:44,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:44,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:44,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:44,480 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:44,480 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1344521511, now seen corresponding path program 2 times [2025-03-17 19:58:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103623365] [2025-03-17 19:58:44,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:44,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:58:44,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:58:44,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:44,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:44,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:58:44,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:58:44,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-03-17 19:58:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942896947] [2025-03-17 19:58:44,519 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:58:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:44,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:44,524 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:44,524 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:58:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:44,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:44,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:44,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash -699983738, now seen corresponding path program 3 times [2025-03-17 19:58:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655499974] [2025-03-17 19:58:44,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:44,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-17 19:58:44,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:58:44,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:58:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:44,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:58:44,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:58:44,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:44,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:44,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:45,065 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:45,065 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:45,065 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:45,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:45,065 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:45,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:45,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:45,065 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2025-03-17 19:58:45,065 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:45,065 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:45,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:45,380 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:45,380 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:45,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,382 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:45,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:58:45,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:45,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:58:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,404 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:45,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 19:58:45,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:45,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:58:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,430 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:45,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 19:58:45,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:45,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 19:58:45,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,455 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:45,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:58:45,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:45,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 19:58:45,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,481 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-17 19:58:45,482 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-17 19:58:45,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:45,507 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-17 19:58:45,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,510 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-17 19:58:45,511 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-17 19:58:45,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:45,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:45,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:45,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:45,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:45,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:45,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:45,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:45,540 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 19:58:45,540 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:58:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:45,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:45,542 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-17 19:58:45,543 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-17 19:58:45,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:45,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:58:45,553 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:45,554 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2025-03-17 19:58:45,559 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-17 19:58:45,570 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 19:58:45,571 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:58:45,571 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:58:45,571 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-17 19:58:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:45,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:58:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:58:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:45,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:45,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:45,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:58:45,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Result 24 states and 29 transitions. Complement of second has 4 states. [2025-03-17 19:58:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-17 19:58:45,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 19:58:45,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:45,682 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:45,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:58:45,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:58:45,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:45,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:45,769 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:58:45,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Result 24 states and 29 transitions. Complement of second has 4 states. [2025-03-17 19:58:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-17 19:58:45,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 19:58:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:45,783 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:45,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 19:58:45,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 19:58:45,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:45,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:45,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:45,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:45,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:45,872 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 19:58:45,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Result 40 states and 48 transitions. Complement of second has 12 states. [2025-03-17 19:58:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:58:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-17 19:58:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-17 19:58:45,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-17 19:58:45,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:45,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2025-03-17 19:58:45,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:45,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 18 letters. Loop has 4 letters. [2025-03-17 19:58:45,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:45,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-03-17 19:58:45,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:45,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 40 transitions. [2025-03-17 19:58:45,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:58:45,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:58:45,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2025-03-17 19:58:45,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:45,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-17 19:58:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2025-03-17 19:58:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-03-17 19:58:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-17 19:58:45,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-17 19:58:45,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-17 19:58:45,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:58:45,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2025-03-17 19:58:45,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:45,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:45,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:45,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:58:45,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:45,930 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:45,930 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:45,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1268803669, now seen corresponding path program 4 times [2025-03-17 19:58:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999592264] [2025-03-17 19:58:45,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:45,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:58:45,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 24 statements. [2025-03-17 19:58:45,941 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:58:45,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:58:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:46,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999592264] [2025-03-17 19:58:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999592264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:46,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091205243] [2025-03-17 19:58:46,007 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:46,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:46,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:46,009 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:46,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-17 19:58:46,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:58:46,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 24 statements. [2025-03-17 19:58:46,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:58:46,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:46,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:46,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:58:46,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:58:46,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091205243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:46,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:46,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-17 19:58:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256512032] [2025-03-17 19:58:46,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:46,178 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-03-17 19:58:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362932717] [2025-03-17 19:58:46,178 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:58:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:46,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:46,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:46,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:46,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:46,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:46,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:46,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:46,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:46,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:46,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:46,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:58:46,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:58:46,206 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 11 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 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-17 19:58:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:46,246 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-17 19:58:46,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2025-03-17 19:58:46,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:46,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 37 transitions. [2025-03-17 19:58:46,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:46,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:58:46,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2025-03-17 19:58:46,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:46,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-17 19:58:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2025-03-17 19:58:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 19:58:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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-17 19:58:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-17 19:58:46,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-17 19:58:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:58:46,252 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-17 19:58:46,252 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:58:46,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2025-03-17 19:58:46,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:46,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:46,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:46,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 19:58:46,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:46,253 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:46,253 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 944239706, now seen corresponding path program 5 times [2025-03-17 19:58:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413091747] [2025-03-17 19:58:46,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:46,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 6 equivalence classes. [2025-03-17 19:58:46,271 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:58:46,271 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-17 19:58:46,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:46,380 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-17 19:58:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413091747] [2025-03-17 19:58:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413091747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528526095] [2025-03-17 19:58:46,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:46,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:46,898 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:46,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-17 19:58:46,941 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 6 equivalence classes. [2025-03-17 19:58:46,964 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:58:46,964 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-17 19:58:46,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:46,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:58:46,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:46,983 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-17 19:58:47,009 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 19 treesize of output 18 [2025-03-17 19:58:47,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:47,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 19:58:47,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,091 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:58:47,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2025-03-17 19:58:47,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,367 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 19:58:47,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 49 [2025-03-17 19:58:47,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:58:47,546 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2025-03-17 19:58:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 51 [2025-03-17 19:58:47,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:47,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 75 [2025-03-17 19:58:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:47,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:47,953 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 53 treesize of output 49 [2025-03-17 19:58:47,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 19:58:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:58:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528526095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:47,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-03-17 19:58:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229445304] [2025-03-17 19:58:47,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:47,957 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-03-17 19:58:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128375188] [2025-03-17 19:58:47,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:47,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:47,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:47,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:47,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:47,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:47,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:47,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:47,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:47,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 19:58:47,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:58:47,997 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 11 Second operand has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:48,418 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-17 19:58:48,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2025-03-17 19:58:48,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:48,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 39 transitions. [2025-03-17 19:58:48,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:48,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:58:48,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2025-03-17 19:58:48,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:48,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 19:58:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2025-03-17 19:58:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-17 19:58:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 19:58:48,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 19:58:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 19:58:48,422 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 19:58:48,422 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:58:48,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2025-03-17 19:58:48,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:48,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:48,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:48,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-17 19:58:48,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:48,423 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:48,423 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1177326777, now seen corresponding path program 6 times [2025-03-17 19:58:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:48,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873186927] [2025-03-17 19:58:48,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:58:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:48,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 6 equivalence classes. [2025-03-17 19:58:48,451 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:58:48,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-17 19:58:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:48,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:58:48,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:58:48,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:48,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:48,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-03-17 19:58:48,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:48,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994089283] [2025-03-17 19:58:48,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:48,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:48,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:48,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:58:48,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:48,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:48,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:48,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:48,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:48,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1834634136, now seen corresponding path program 7 times [2025-03-17 19:58:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:48,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323753055] [2025-03-17 19:58:48,469 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:58:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:48,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:58:48,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:58:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:48,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:48,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:58:48,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:58:48,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:48,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:48,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:49,836 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:58:49,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:58:49,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:58:49,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:58:49,836 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:58:49,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:49,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:58:49,836 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:58:49,836 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2025-03-17 19:58:49,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:58:49,836 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:58:49,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:49,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:50,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:50,224 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:50,224 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,227 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-17 19:58:50,227 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-17 19:58:50,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,245 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-17 19:58:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,247 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-17 19:58:50,247 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-17 19:58:50,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,266 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-17 19:58:50,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,268 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-17 19:58:50,269 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-17 19:58:50,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,286 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-17 19:58:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,288 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-17 19:58:50,289 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-17 19:58:50,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,306 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-17 19:58:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,308 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-17 19:58:50,309 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-17 19:58:50,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,326 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-17 19:58:50,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,328 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-17 19:58:50,329 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-17 19:58:50,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 19:58:50,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,347 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-17 19:58:50,348 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-17 19:58:50,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,365 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-17 19:58:50,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,367 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-17 19:58:50,368 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-17 19:58:50,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 19:58:50,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,388 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-17 19:58:50,389 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-17 19:58:50,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:50,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:50,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:50,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 19:58:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,409 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-17 19:58:50,409 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-17 19:58:50,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:50,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:50,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,428 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-17 19:58:50,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,430 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-17 19:58:50,431 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-17 19:58:50,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:50,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:50,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:50,455 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-17 19:58:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,457 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-17 19:58:50,458 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-17 19:58:50,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:58:50,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:50,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:50,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:50,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:50,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:50,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:50,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:50,487 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 19:58:50,487 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:58:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:50,491 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-17 19:58:50,492 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-17 19:58:50,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:50,509 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:58:50,509 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:50,509 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2025-03-17 19:58:50,515 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-17 19:58:50,541 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:58:50,543 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:58:50,543 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:58:50,543 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-17 19:58:50,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:50,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:58:50,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:58:50,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:50,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:50,673 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:50,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:50,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 4 states. [2025-03-17 19:58:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-17 19:58:50,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 19:58:50,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:50,687 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:50,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:58:50,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:58:50,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:50,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:50,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:50,827 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:50,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:50,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 4 states. [2025-03-17 19:58:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-17 19:58:50,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 19:58:50,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:50,844 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:58:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:50,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 19:58:50,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:58:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:50,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:50,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:50,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:58:50,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:58:50,981 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 19:58:50,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:51,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 57 transitions. Complement of second has 14 states. [2025-03-17 19:58:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:58:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2025-03-17 19:58:51,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 19:58:51,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:51,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-17 19:58:51,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:51,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 27 letters. Loop has 4 letters. [2025-03-17 19:58:51,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:51,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2025-03-17 19:58:51,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:51,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 49 transitions. [2025-03-17 19:58:51,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:58:51,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:58:51,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2025-03-17 19:58:51,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:51,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-17 19:58:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2025-03-17 19:58:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-03-17 19:58:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 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-17 19:58:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-17 19:58:51,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 19:58:51,062 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 19:58:51,062 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:58:51,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2025-03-17 19:58:51,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:51,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:51,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:51,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-17 19:58:51,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:51,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:51,063 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1503588797, now seen corresponding path program 8 times [2025-03-17 19:58:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522946558] [2025-03-17 19:58:51,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:51,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 19:58:51,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:58:51,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:51,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:51,137 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-17 19:58:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:58:51,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522946558] [2025-03-17 19:58:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522946558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959387651] [2025-03-17 19:58:51,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:51,208 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-17 19:58:51,209 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-17 19:58:51,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 19:58:51,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:58:51,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:51,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:51,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:58:51,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:58:51,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:58:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959387651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:51,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:51,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-17 19:58:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228257284] [2025-03-17 19:58:51,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:51,441 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-03-17 19:58:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825125008] [2025-03-17 19:58:51,441 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:51,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 19:58:51,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:51,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:51,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:51,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:51,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:58:51,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:58:51,476 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 11 Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:51,536 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-17 19:58:51,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2025-03-17 19:58:51,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:51,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 40 states and 46 transitions. [2025-03-17 19:58:51,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:58:51,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:58:51,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2025-03-17 19:58:51,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:51,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-17 19:58:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2025-03-17 19:58:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 19:58:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 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-17 19:58:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-03-17 19:58:51,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-17 19:58:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:58:51,540 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-03-17 19:58:51,540 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:58:51,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2025-03-17 19:58:51,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:51,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:51,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:51,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 19:58:51,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:51,541 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:51,541 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:51,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash 496134638, now seen corresponding path program 9 times [2025-03-17 19:58:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:51,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130476247] [2025-03-17 19:58:51,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:51,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 7 equivalence classes. [2025-03-17 19:58:51,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:58:51,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:58:51,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:58:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130476247] [2025-03-17 19:58:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130476247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175061939] [2025-03-17 19:58:52,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:52,248 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-17 19:58:52,249 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-17 19:58:52,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 7 equivalence classes. [2025-03-17 19:58:52,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:58:52,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:58:52,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 19:58:52,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:52,343 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-17 19:58:52,351 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 19 treesize of output 18 [2025-03-17 19:58:52,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 19:58:52,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-17 19:58:52,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-17 19:58:52,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 44 [2025-03-17 19:58:52,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 34 [2025-03-17 19:58:52,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 19:58:52,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-03-17 19:58:52,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:58:52,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 19:58:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 73 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:58:52,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 67 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:58:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175061939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:53,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 41 [2025-03-17 19:58:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983035715] [2025-03-17 19:58:53,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:53,158 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:53,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-03-17 19:58:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625583341] [2025-03-17 19:58:53,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:53,161 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:53,162 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:53,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:53,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:53,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:53,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:53,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:53,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:53,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 19:58:53,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 19:58:53,191 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 11 Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:55,022 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2025-03-17 19:58:55,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 129 transitions. [2025-03-17 19:58:55,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 19:58:55,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 110 states and 123 transitions. [2025-03-17 19:58:55,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 19:58:55,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 19:58:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 123 transitions. [2025-03-17 19:58:55,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:55,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 123 transitions. [2025-03-17 19:58:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 123 transitions. [2025-03-17 19:58:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2025-03-17 19:58:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2025-03-17 19:58:55,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-03-17 19:58:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-17 19:58:55,028 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-03-17 19:58:55,028 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:58:55,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 96 transitions. [2025-03-17 19:58:55,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:58:55,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:55,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:55,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 19:58:55,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:58:55,030 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:58:55,030 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:58:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 379069676, now seen corresponding path program 10 times [2025-03-17 19:58:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187557904] [2025-03-17 19:58:55,031 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:55,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 19:58:55,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:58:55,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:55,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:58:55,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:58:55,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:55,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-03-17 19:58:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:55,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669824983] [2025-03-17 19:58:55,088 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:58:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:55,091 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:55,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:55,092 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:58:55,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:55,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:58:55,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:58:55,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:55,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:55,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash -786261237, now seen corresponding path program 11 times [2025-03-17 19:58:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680248708] [2025-03-17 19:58:55,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:55,102 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 7 equivalence classes. [2025-03-17 19:58:55,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:58:55,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 19:58:55,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:55,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:58:55,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:58:55,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:55,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:55,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:01,968 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 247 DAG size of output: 189 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:59:02,146 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:02,147 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:02,147 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:02,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:02,147 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:02,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:02,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:02,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration15_Lasso [2025-03-17 19:59:02,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:02,147 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:02,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:02,592 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:02,592 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:02,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,594 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 19:59:02,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:02,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:02,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:02,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 19:59:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,614 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 19:59:02,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:02,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:02,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:02,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,637 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 19:59:02,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,660 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 19:59:02,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:02,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:02,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:02,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 19:59:02,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,680 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 19:59:02,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:02,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:02,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:02,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 19:59:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,701 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 19:59:02,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:02,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:02,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:02,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:02,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,728 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 19:59:02,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 19:59:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,757 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 19:59:02,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-17 19:59:02,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 19:59:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,786 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 19:59:02,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 19:59:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,812 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 19:59:02,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-17 19:59:02,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,834 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 19:59:02,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 19:59:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,874 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 19:59:02,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 19:59:02,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,900 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-17 19:59:02,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 19:59:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,926 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 19:59:02,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:02,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 19:59:02,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,948 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 19:59:02,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:02,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:02,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:02,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:02,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:02,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:02,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:02,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:02,976 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-17 19:59:02,976 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 19:59:02,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:02,978 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:59:02,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 19:59:02,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:02,990 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:02,990 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:02,990 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1 Supporting invariants [] [2025-03-17 19:59:02,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 19:59:03,034 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-03-17 19:59:03,036 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 19:59:03,036 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 19:59:03,036 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-17 19:59:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:03,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:59:03,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:59:03,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:03,247 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:59:03,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,282 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 96 transitions. Complement of second has 5 states. [2025-03-17 19:59:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:59:03,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-17 19:59:03,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:03,283 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:59:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:59:03,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:59:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:03,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:03,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:03,559 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:59:03,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 96 transitions. Complement of second has 5 states. [2025-03-17 19:59:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:59:03,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-17 19:59:03,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:03,596 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:59:03,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:03,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 19:59:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 19:59:03,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:59:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:59:03,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:03,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:03,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:59:03,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:59:03,814 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-17 19:59:03,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 128 transitions. Complement of second has 17 states. [2025-03-17 19:59:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 19:59:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2025-03-17 19:59:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-17 19:59:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 40 letters. Loop has 2 letters. [2025-03-17 19:59:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 38 letters. Loop has 4 letters. [2025-03-17 19:59:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:03,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 128 transitions. [2025-03-17 19:59:03,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:59:03,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 102 states and 115 transitions. [2025-03-17 19:59:03,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 19:59:03,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:59:03,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 115 transitions. [2025-03-17 19:59:03,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:03,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-17 19:59:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 115 transitions. [2025-03-17 19:59:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2025-03-17 19:59:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-17 19:59:03,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-17 19:59:03,975 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-17 19:59:03,975 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:59:03,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 109 transitions. [2025-03-17 19:59:03,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:59:03,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:03,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:03,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 8, 6, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-17 19:59:03,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:59:03,976 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-17 19:59:03,976 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2025-03-17 19:59:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1422429553, now seen corresponding path program 12 times [2025-03-17 19:59:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894907545] [2025-03-17 19:59:03,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:59:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:03,986 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-03-17 19:59:04,011 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 34 of 46 statements. [2025-03-17 19:59:04,011 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 19:59:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:04,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 19:59:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 5 proven. 178 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:59:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894907545] [2025-03-17 19:59:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894907545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:59:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952534608] [2025-03-17 19:59:06,393 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:59:06,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:59:06,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:06,395 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:59:06,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-17 19:59:06,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-03-17 19:59:06,612 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 34 of 46 statements. [2025-03-17 19:59:06,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 19:59:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:06,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 19:59:06,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:06,630 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-17 19:59:06,635 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 19 treesize of output 18 [2025-03-17 19:59:06,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:59:06,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 19:59:06,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:59:06,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-17 19:59:06,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:59:06,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-17 19:59:06,947 INFO L349 Elim1Store]: treesize reduction 78, result has 53.0 percent of original size [2025-03-17 19:59:06,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 66 treesize of output 117 [2025-03-17 19:59:07,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,438 INFO L349 Elim1Store]: treesize reduction 110, result has 14.1 percent of original size [2025-03-17 19:59:07,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 76 treesize of output 62 [2025-03-17 19:59:07,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,598 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-03-17 19:59:07,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 48 [2025-03-17 19:59:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:07,890 INFO L349 Elim1Store]: treesize reduction 122, result has 46.5 percent of original size [2025-03-17 19:59:07,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 78 treesize of output 132 [2025-03-17 19:59:08,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 19:59:09,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:59:09,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 7 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 367 treesize of output 1177